A comment on Intersecting Families of Permutations
classification
🧮 math.CO
keywords
ellispermutationscharacterizationfamiliesfriedgutintersectingpilpelalready
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Tiling the symmetric group by transpositions
A new necessary condition is established that Y must be partition-transitive w.r.t. certain partitions of n for (T_n, Y) to tile S_n, generalizing Rothaus-Thompson and Nomura, with a conjecture that neither T_n nor T_...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.