Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings

Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings

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$.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chase, Gilad, Dafni, Neta, Filmus, Yuval, Lindzey, Nathan
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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$.
DOI:10.48550/arxiv.2210.00245