Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings
classification
🧮 math.CO
keywords
familiesintersectingmatchingsperfectpermutationscharacterizationcompletegive
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.