A note on supersaturated set systems

DOI10.1016/J.EJC.2015.03.028zbMATH Open1321.05284OpenAlexW2194022954WikidataQ101496293 ScholiaQ101496293MaRDI QIDQ499460FDOQ499460

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

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

Recommendations

• Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem
• A Katona-type proof of an Erdős-Ko-Rado-type theorem
• The Erdős-Ko-Rado theorem for small families
• Erdös-Ko-Rado from intersecting shadows
• scientific article; zbMATH DE number 3900758

zbMATH Keywords

Erdős-Ko-Rado theorem

Mathematics Subject Classification ID

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

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On a packing and covering problem
• The difference between consecutive primes. II
• Title not available (Why is that?)
• The exact bound in the Erdős-Ko-Rado theorem
• A new short proof of the EKR theorem
• Sperner's theorem and a problem of Erdős, Katona and Kleitman
• Simple hypergraphs with maximal number of adjacent pairs of edges
• On the minimum number of disjoint pairs in a family of finite sets
• Set systems with few disjoint pairs
• On the difference between asymptotically good packings and coverings

Cited In (6)

• Structure and supersaturation for intersecting families
• Title not available (Why is that?)
• Unified approach to the generalized Turán problem and supersaturation
• Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
• Title not available (Why is that?)
• Non-trivial \(d\)-wise intersecting families

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499460)