Uniqueness for 2-intersecting families of permutations and perfect matchings
Abstract
We give a characterization of the largest 2 -intersecting families of permutations of { 1 , 2 , ... , n } and of perfect matchings of the complete graph K 2 n for all n ≥ 2 .
Fields of Study & Subjects
Limits and Structures in Graph Theory
Graph Labeling and Dimension Problems
graph theory and CDMA systems
Publication details
- Journal / source
- Algebraic Combinatorics
- Volume
- 9
- Issue
- 2
- Pages
- 357–377
- Publication date
- 30 April 2026
- Language
- EN