A pushing-pulling method: New proofs of intersection theorems
From MaRDI portal
Recommendations
Cited in
(21)- The maximum measure of 3-wise t-intersecting families
- The Edge-Diametric Theorem in Hamming Spaces
- The \(t\)-intersection problem in the truncated Boolean lattice
- Stability of large rainbow intersecting families with product measure
- More complete intersection theorems
- The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes
- Katona's intersection theorem: four proofs
- The weighted complete intersection theorem
- Short proofs of three results about intersecting systems
- Uniqueness for 2-intersecting families of permutations and perfect matchings
- r$r$‐Cross t$t$‐intersecting families via necessary intersection points
- A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances
- Reflect-push methods. Part I: Two dimensional techniques
- Multiply intersecting families of sets
- A new short proof of a theorem of Ahlswede and Khachatrian
- Non-uniform pairwise cross t-intersecting families
- Invitation to intersection problems for finite sets
- Forbidden sparse intersections
- An intersection theorem for systems of finite sets
- Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families
- The edge-diametric theorem in Hamming spaces
This page was built for publication: A pushing-pulling method: New proofs of intersection theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932697)