A comment on Intersecting Families of Permutations

2017/06/30 by Filmus, Yuval · 2 citations
Computer Science · Engineering · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1706.10146

openalex publication_date 2017/06/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Ellis, Friedgut and Pilpel proved that for large enough n, a t-intersecting family of permutations contains at most (n-t)! permutations. Their main theorem also states that equality holds only for t-cosets. We show that their proof of the characterization of extremal families is wrong. However, the characterization follows from a paper of Ellis, as mentioned already by Ellis, Friedgut and Pilpel.

Cited by

• Graphical Designs find Combinatorial Structures
• Tiling symmetric groups by transpositions

Related

• On t-Intersecting Families of Permutations
• An almost complete t-intersection theorem for permutations
• Forbidding just one intersection, for permutations
• Stability for t-intersecting families of permutations
• Intersecting families of sets and permutations: a survey