Complete Partite subgraphs in dense hypergraphs

DOI10.1002/rsa.20441zbMath1255.05151OpenAlexW1986438695MaRDI QIDQ3145843

Mathias Schacht, Vojtěch Rödl

Publication date: 14 December 2012

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20441

zbMATH Keywords

blow-upsErdős-Hajnal conjecturepartite hypergraphsKövari-Sós-Turán theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Related Items (4)

On a topological version of Pach's overlap theorem ⋮ Two Erdős-Hajnal-type theorems in hypergraphs ⋮ Analytic methods for uniform hypergraphs ⋮ Erdős-Hajnal-type theorems in hypergraphs

Cites Work

• Large almost monochromatic subsets in hypergraphs
• Ramsey-type theorems
• Supersaturated graphs and hypergraphs
• Complete \(r\)-partite subgraphs of dense \(r\)-graphs
• On extremal problems of graphs and generalized graphs
• On the Structure of Edge Graphs II
• Regularity properties for triple systems
• Extremal problems on set systems
• Hereditary Properties of Triple Systems
• Graphs with many r -cliques have large complete r -partite subgraphs
• On the structure of linear graphs
• The asymptotic number of triple systems not containing a fixed one

This page was built for publication: Complete Partite subgraphs in dense hypergraphs