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
Veröffentlicht in:arXiv.org 2022-10
Hauptverfasser: Chase, Gilad, Dafni, Neta, Filmus, Yuval, Lindzey, Nathan
Format: Artikel
Sprache:eng
Schlagworte:
Permutations
Online-Zugang:Volltext
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\).
ISSN:2331-8422