Unavoidable subhypergraphs: a-clusters

DOI10.1016/J.JCTA.2011.05.002MaRDI QIDQ640838zbMATH OpenOpenAlexFDO

Authors Lale Özkahya, Zoltán Füredi

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

Erdős-Ko-Radohypergraphstraces

Mathematics Subject Classification ID

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

Recommendations

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

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
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On a packing and covering problem
• On disjointly representable sets
• On finite set-systems whose every intersection is a kernel of a star
• On generalized graphs
• On Sperner families satisfying an additional condition
• 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
• Set systems without a strong simplex

Cited in

(14)

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

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 Q640838)