A note on supersaturated set systems

DOI10.1016/j.ejc.2015.03.028zbMath1321.05284OpenAlexW2194022954WikidataQ101496293 ScholiaQ101496293MaRDI QIDQ499460

Vojtěch Rödl, Peter Frankl, Yoshiharu Kohayakawa

Publication date: 30 September 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2015.03.028

zbMATH Keywords

Erdős-Ko-Rado theorem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial inequalities (05A20) Extremal set theory (05D05)

Related Items (3)

Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations ⋮ Structure and supersaturation for intersecting families ⋮ Unified approach to the generalized Turán problem and supersaturation

Cites Work

• Unnamed Item
• A new short proof of the EKR theorem
• The exact bound in the Erdős-Ko-Rado theorem
• On a packing and covering problem
• Simple hypergraphs with maximal number of adjacent pairs of edges
• On the minimum number of disjoint pairs in a family of finite sets
• On the difference between asymptotically good packings and coverings
• Set systems with few disjoint pairs
• The Difference Between Consecutive Primes, II
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Sperner's Theorem and a Problem of Erdős, Katona and Kleitman

This page was built for publication: A note on supersaturated set systems