Abstract
We give a characterization of the largest 2-intersecting families of permutations of textbackslash1,2,textbackslashldots,ntextbackslash and of perfect matchings of the complete graph K2n for all n textbackslashgeq 2.
Original language | Undefined/Unknown |
---|---|
Journal | arXiv preprint arXiv:2210.00245 |
DOIs | |
State | Published - 2022 |
Keywords
- 05D05
- Combinatorics (math.CO)
- FOS: Mathematics