More complete intersection theorems

DOI10.1016/j.disc.2018.09.017zbMath1400.05251OpenAlexW2897383293MaRDI QIDQ1618227

Yuval Filmus

Publication date: 13 November 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.09.017

zbMATH Keywords

extremal combinatoricsintersecting familiesErdős-Ko-Rado theory

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items

r$r$‐Cross t$t$‐intersecting families via necessary intersection points, The maximum measure of non-trivial 3-wise intersecting families

Cites Work

• The complete intersection theorem for systems of finite sets
• On the hardness of approximating minimum vertex cover
• Proof of an intersection theorem via graph homomorphisms
• On the measure of intersecting families, uniqueness and stability
• Some intersection theorems for ordered sets and graphs
• On Sperner families satisfying an additional condition
• The diametric theorem in Hamming spaces---optimal anticodes
• Graph products, Fourier analysis and spectral techniques
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The weighted complete intersection theorem
• Triangle-intersecting families of graphs
• A simple proof of the Erdős-Chao Ko-Rado theorem
• A Katona-type proof of an Erdős-Ko-Rado-type theorem
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Properties of vertex packing and independence system polyhedra
• A pushing-pulling method: New proofs of intersection theorems
• Towards a Katona type proof for the \(2\)-intersecting Erdős-Ko-Rado theorem