A pushing-pulling method: New proofs of intersection theorems
From MaRDI portal
Publication:5932697
DOI10.1007/s004930050042zbMath0980.05049OpenAlexW2047141034MaRDI QIDQ5932697
Publication date: 13 June 2001
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930050042
Related Items (14)
More complete intersection theorems ⋮ The weighted complete intersection theorem ⋮ r$r$‐Cross t$t$‐intersecting families via necessary intersection points ⋮ The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes ⋮ Reflect-push methods. Part I: Two dimensional techniques ⋮ The maximum measure of 3-wise \(t\)-intersecting families ⋮ A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances ⋮ The edge-diametric theorem in Hamming spaces ⋮ An intersection theorem for systems of finite sets ⋮ Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families ⋮ Invitation to intersection problems for finite sets ⋮ Multiply intersecting families of sets ⋮ The Edge-Diametric Theorem in Hamming Spaces ⋮ The \(t\)-intersection problem in the truncated Boolean lattice
This page was built for publication: A pushing-pulling method: New proofs of intersection theorems
