A new short proof of a theorem of Ahlswede and Khachatrian
This paper gives a new, short proof for the nontrivial intersection theorem of Ahlswede and Khachatrian (conjectured originally by Frankl and Füredi): Let \(2\leq t+1\leq k \leq 2t+1\) and \(n\geq (t+1)(k-t+1).\) Let \(\mathcal F\) be a \(k\)-uniform \(t\)-intersecting family on an \(n\)-set. If \(| \bigcap_{F\in {\mathcal F}}F| \leq t\) then \(| {\mathcal F}| \leq (t+2){n-t-2 \choose k-t-1} + {n-t-2 \choose k-t-2}.\) The proof is based on the compression method and on Wilson's theorem on the exact bound of the Erdős-Ko-Rado theorem.
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Non-trivial intersecting families
- On intersecting families of finite sets
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The complete intersection theorem for systems of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- The exact bound in the Erdős-Ko-Rado theorem
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
- Vertex isoperimetry and independent set stability for tensor powers of cliques
- A cross‐intersection theorem for subsets of a set
- A pushing-pulling method: New proofs of intersection theorems
- Non-uniform pairwise cross t-intersecting families
This page was built for publication: A new short proof of a theorem of Ahlswede and Khachatrian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474500)
