On Mubayi's Conjecture and Conditionally Intersecting Sets

DOI10.1137/18M1166250zbMath1396.05112arXiv1711.05442OpenAlexW2963939467WikidataQ123355532 ScholiaQ123355532MaRDI QIDQ4684465

Adam Mammoliti, Thomas Britz

Publication date: 1 October 2018

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

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

zbMATH Keywords

Erdős-Ko-Rado theoremextremal set theoryunstableintersecting setsMubayi's conjecture

Mathematics Subject Classification ID

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

Related Items (3)

Structural results for conditionally intersecting families and some applications ⋮ Tight bounds for Katona's shadow intersection theorem ⋮ \(d\)-cluster-free sets with a given matching number

Cites Work

• Unnamed Item
• Set systems without a simplex or a cluster
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters
• The complete intersection theorem for systems of finite sets
• Set systems with union and intersection constraints
• Non-trivial intersecting families
• Shadows and shifting
• On Sperner families satisfying an additional condition
• The complete nontrivial-intersection theorem for systems of finite sets
• Counting families of mutually intersecting sets
• Erdős--Ko--Rado for three sets
• An intersection theorem for four sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Simplex Stability
• Families of Sets with Intersecting Clusters
• Intersection theorems for systems of finite sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: On Mubayi's Conjecture and Conditionally Intersecting Sets