Unavoidable subhypergraphs: a-clusters

DOI10.1016/j.endm.2009.07.011zbMath1272.05138OpenAlexW2049196396MaRDI QIDQ2851439

Lale Özkahya, Zoltan Fueredi

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.011

zbMATH Keywords

extremal hypergraph theoryTuran problemunavoidable subhypergraphs

Mathematics Subject Classification ID

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

Related Items (1)

On set systems without a simplex-cluster and the junta method

Cites Work

• 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
• 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
• Families of Sets with Intersecting Clusters
• An Extremal Set-Intersection Theorem
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: Unavoidable subhypergraphs: a-clusters