Mathematics > Combinatorics
arXiv:2210.00245 (math)
[Submitted on 1 Oct 2022 (v1), last revised 16 Jun 2026 (this version, v2)]
Abstract:We give a characterization of the largest $2$-intersecting families of permutations of $\{1,2,\ldots,n\}$ and of perfect matchings of the complete graph $K_{2n}$ for all $n \geq 2$.
Submission history
From: Yuval Filmus [view email]
[v1]
Sat, 1 Oct 2022 10:38:56 UTC (25 KB)
[v2]
Tue, 16 Jun 2026 07:53:46 UTC (22 KB)
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.




















