Most probably intersecting hypergraphs

zbMath1310.05150arXiv1312.0840MaRDI QIDQ2341073

Shagnik Das, Benjamin Sudakov

Publication date: 22 April 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.0840

zbMATH Keywords

Erdős-Ko-Rado theoremextremal set theoryintersecting familiessupersaturation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Related Items

Domination in intersecting hypergraphs ⋮ A simple removal lemma for large nearly-intersecting families ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ Removal and Stability for Erdös--Ko--Rado ⋮ Matching criticality in intersecting hypergraphs

Cites Work

• Unnamed Item
• The minimum number of disjoint pairs in set systems and related problems
• 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
• Most Probably Intersecting Families of Subsets
• Compressions and Probably Intersecting Families
• On a problem of Ahlswede and Katona
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Sum of squares of degrees in a graph
• Graphs with maximal number of adjacent pairs of edges
• Probably Intersecting Families are Not Nested
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS