An intersection theorem for four sets

DOI10.1016/J.AIM.2006.11.013zbMATH Open1129.05055OpenAlexW2012516954MaRDI QIDQ2383002FDOQ2383002

Authors: Dhruv Mubayi 

Publication date: 5 October 2007

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aim.2006.11.013

Recommendations

• Some exact results for multiply intersecting families
• scientific article; zbMATH DE number 3991507
• An intersection theorem for systems of sets
• scientific article; zbMATH DE number 3900758
• Non-trivial \(d\)-wise intersecting families

zbMATH Keywords

intersection familyExtremal set theoryErdős-Ko-Rado theorem

Mathematics Subject Classification ID

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

Cites Work

• On a hypergraph Turán problem of Frankl
• Graph Theory and Probability
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Title not available (Why is that?)
• Forbidding just one intersection
• Title not available (Why is that?)
• Hypergraphs in which all disjoint pairs have distinct unions
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The number of graphs without forbidden subgraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Exact computation of the hypergraph Turán function for expanded complete 2-graphs
• Proof of a conjecture of Erdős on triangles in set-systems
• A new generalization of the Erdős-Ko-Rado theorem
• The Turán number of the Fano plane
• Triple Systems Not Containing a Fano Configuration
• Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
• On Triple Systems with Independent Neighbourhoods
• A hypergraph extension of the bipartite Turán problem
• 4-books of three pages
• Erdős--Ko--Rado for three sets
• Structure and stability of triangle-free set systems

Cited In (21)

• On set systems without a simplex-cluster and the junta method
• A product version of the Erdős-Ko-Rado theorem
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters
• New results on simplex-clusters in set systems
• A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
• Two-regular subgraphs of hypergraphs
• Simplex stability
• On the \(d\)-cluster generalization of Erdős-Ko-Rado
• Uniform hypergraphs under certain intersection constraints between hyperedges
• Turán problems and shadows. I: Paths and cycles
• On Mubayi's conjecture and conditionally intersecting sets
• Multiply-intersecting families revisited
• Set systems without a simplex or a cluster
• Structural results for conditionally intersecting families and some applications
• \(d\)-cluster-free sets with a given matching number
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• The maximum size of intersecting and union families of sets
• A structural result for 3-graphs
• Sparse hypergraphs with low independence number
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters
• Set systems with union and intersection constraints

This page was built for publication: An intersection theorem for four sets

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