Unavoidable subhypergraphs: \(\mathbf a\)-clusters

DOI10.1016/j.jcta.2011.05.002zbMath1238.05185OpenAlexW2069654053MaRDI QIDQ640838

Lale Özkahya, Zoltan Fueredi

Publication date: 21 October 2011

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2011.05.002

zbMATH Keywords

hypergraphstracesErdős-Ko-Rado

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)

Related Items (10)

Hypergraphs without non-trivial intersecting subgraphs ⋮ Structural results for conditionally intersecting families and some applications ⋮ Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ Extremal Problems for Hypergraph Blowups of Trees ⋮ On Multicolor Ramsey Numbers of Triple System Paths of Length 3 ⋮ Hypergraph Turán numbers of linear cycles ⋮ On Mubayi's Conjecture and Conditionally Intersecting Sets ⋮ Linear trees in uniform hypergraphs ⋮ On the \(d\)-cluster generalization of Erdős-Ko-Rado ⋮ \(d\)-cluster-free sets with a given matching number

Cites Work

• Unnamed Item
• Unnamed Item
• Set systems without a simplex or a cluster
• On finite set-systems whose every intersection is a kernel of a star
• On disjointly representable sets
• On the VC-dimension of uniform hypergraphs
• Set systems with union and intersection constraints
• On a packing and covering problem
• Forbidding just one intersection
• Exact solution of some Turán-type problems
• On Sperner families satisfying an additional condition
• Counterexample to the Frankl-Pach conjecture for uniform, dense families
• Proof of a conjecture of Erdős on triangles in set-systems
• Erdős--Ko--Rado for three sets
• An intersection theorem for four sets
• Set Systems without a Strong Simplex
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Families of Sets with Intersecting Clusters
• An Extremal Set-Intersection Theorem
• On generalized graphs
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: Unavoidable subhypergraphs: \(\mathbf a\)-clusters