Unavoidable subhypergraphs: a-clusters

DOI10.1016/J.ENDM.2009.07.011MaRDI QIDQ2851439zbMATH OpenOpenAlexFDO

Authors Lale Özkahya, Zoltán Füredi

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)

Recommendations

• Unavoidable subhypergraphs: \(\mathbf a\)-clusters
• scientific article; zbMATH DE number 4200236
• On unavoidable hypergraphs
• On the \(d\)-cluster generalization of Erdős-Ko-Rado
• On set systems without a simplex-cluster and the junta method

Cites work

• A new generalization of the Erdős-Ko-Rado theorem
• An Extremal Set-Intersection Theorem
• An intersection theorem for four sets
• Counterexample to the Frankl-Pach conjecture for uniform, dense families
• Erdős--Ko--Rado for three sets
• Exact solution of some Turán-type problems
• Families of sets with intersecting clusters
• Forbidding just one intersection
• On a packing and covering problem
• On disjointly representable sets
• On finite set-systems whose every intersection is a kernel of a star
• On the VC-dimension of uniform hypergraphs
• Proof of a conjecture of Erdős on triangles in set-systems
• Set systems with union and intersection constraints
• Set systems without a simplex or a cluster

Cited in

(2)

• On set systems without a simplex-cluster and the junta method
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters

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

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