Proves that for sufficiently large n the maximum t-intersecting families in S_n are the fixed-point families F_{n,t,r}, resolving the Deza-Frankl problem asymptotically.
Uniqueness for 2-intersecting families of permutations and perfect matchings.Algebraic Combinatorics, 9(2):357–377, 2026
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Complete Intersection Theorem for Large Permutation Groups
Proves that for sufficiently large n the maximum t-intersecting families in S_n are the fixed-point families F_{n,t,r}, resolving the Deza-Frankl problem asymptotically.