Set systems with union and intersection constraints

DOI10.1016/j.jctb.2008.10.004zbMath1229.05080OpenAlexW2060049687MaRDI QIDQ1026003

Dhruv Mubayi, Reshma Ramadurai

Publication date: 23 June 2009

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2008.10.004

zbMATH Keywords

clusterintersecting familyextremal set theory

Mathematics Subject Classification ID

Extremal set theory (05D05) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Unavoidable subhypergraphs: \(\mathbf a\)-clusters, New results on simplex-clusters in set systems, A structural result for 3-graphs, On set systems without a simplex-cluster and the junta method, On Mubayi's Conjecture and Conditionally Intersecting Sets, On the \(d\)-cluster generalization of Erdős-Ko-Rado, \(d\)-cluster-free sets with a given matching number, Unavoidable subhypergraphs: a-clusters

Cites Work

• Unnamed Item
• Set systems without a simplex or a cluster
• Erdős--Ko--Rado for three sets
• An intersection theorem for four sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• An Extremal Set-Intersection Theorem
• A new generalization of the Erdős-Ko-Rado theorem