Recommendations
Cites work
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- A new short proof of the EKR theorem
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On a packing and covering problem
- On the difference between asymptotically good packings and coverings
- On the minimum number of disjoint pairs in a family of finite sets
- Set systems with few disjoint pairs
- Simple hypergraphs with maximal number of adjacent pairs of edges
- Sperner's theorem and a problem of Erdős, Katona and Kleitman
- The difference between consecutive primes. II
- The exact bound in the Erdős-Ko-Rado theorem
Cited in
(6)- Structure and supersaturation for intersecting families
- scientific article; zbMATH DE number 1919511 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1305307 (Why is no real title available?)
- 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)