Hypergraphs with vanishing Turán density in uniformly dense hypergraphs

DOI10.1112/jlms.12095zbMath1382.05038arXiv1706.08873OpenAlexW3123069307MaRDI QIDQ4608161

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

Publication date: 16 March 2018

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

hereditary density condition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Density (toughness, etc.) (05C42)

Related Items

Embedding tetrahedra into quasirandom hypergraphs, Extremal problems in uniformly dense hypergraphs, Uniform Turán density of cycles, Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm, F$F$‐factors in Quasi‐random Hypergraphs, Restricted problems in extremal combinatorics, Tiling multipartite hypergraphs in quasi-random hypergraphs

Cites Work

• Unnamed Item
• Embedding tetrahedra into quasirandom hypergraphs
• Weak hypergraph regularity and linear hypergraphs
• Some Ramsey-Turán type results for hypergraphs
• Hypergraphs, quasi-randomness, and conditions for regularity
• On Ramsey - Turan type theorems for hypergraphs
• On extremal problems of graphs and generalized graphs
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Extremal problems on set systems
• On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Regular Partitions of Hypergraphs: Counting Lemmas