Embedding tetrahedra into quasirandom hypergraphs

DOI10.1016/j.jctb.2016.06.008zbMath1348.05141arXiv1602.02289OpenAlexW3106426318WikidataQ105468642 ScholiaQ105468642MaRDI QIDQ326814

Mathias Schacht, Christian Reiher, Vojtěch Rödl

Publication date: 12 October 2016

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

Full work available at URL: https://arxiv.org/abs/1602.02289

zbMATH Keywords

extremal graph theorytetrahedronquasirandom hypergraphsTurán's problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Related Items (12)

Counting results for sparse pseudorandom hypergraphs. II. ⋮ Extremal problems in uniformly dense hypergraphs ⋮ The codegree threshold of \(K_4^-\) ⋮ Uniform Turán density of cycles ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Restricted problems in extremal combinatorics ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ Hypergraphs with vanishing Turán density in uniformly dense hypergraphs ⋮ Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs ⋮ A tight bound for hypergraph regularity ⋮ Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs

Cites Work

• A problem of Erdős and Sós on 3-graphs
• On universality of graphs with uniformly distributed edges
• Hypergraphs, quasi-randomness, and conditions for regularity
• On a Turán problem in weakly quasirandom 3-uniform hypergraphs
• σ-algebras for quasirandom hypergraphs
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Paul turán, 1910–1976: His work in graph theory
• Extremal problems on set systems
• Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Regular Partitions of Hypergraphs: Counting Lemmas
• Flag algebras
• On the structure of linear graphs
• Quasi-random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Embedding tetrahedra into quasirandom hypergraphs