An intersection theorem for four sets

DOI10.1016/J.AIM.2006.11.013MaRDI QIDQ2383002zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Erdős-Ko-Rado theoremExtremal set theoryintersection family

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(22)

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

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)