An almost complete $t$-intersection theorem for permutations
<|reference_start|>An almost complete $t$-intersection theorem for permutations: For any $\epsilon>0$ and $n>(1+\epsilon)t$, $n>n_0(\epsilon)$ we determine the size of the largest $t$-intersecting family of permutations, as well as give a sharp stability result. This resolves a conjecture of Ellis, Friedgut and Pilpel (2011) and shows the validity of conjectures of Frankl and Deza (1977) and Cameron (1988) for $n>(1+\epsilon )t$. We note that, for this range of parameters, the extremal examples are not necessarily trivial, and that our statement is analogous to the celebrated Ahlswede-Khachatrian theorem. The proof is based on the refinement of the method of spread approximations, recently introduced by Kupavskii and Zakharov (2022).<|reference_end|>
@article{kupavskii2024an,
    title={An almost complete $t$-intersection theorem for permutations},
    author={Andrey Kupavskii},
    journal={arXiv preprint arXiv:2405.07843},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.07843},
    primaryClass={math.CO cs.DM}
}