On a Turán problem in weakly quasirandom 3-uniform hypergraphs

DOI10.4171/JEMS/784zbMath1387.05125arXiv1602.02290OpenAlexW3103627143MaRDI QIDQ1751613

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

Publication date: 25 May 2018

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

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

zbMATH Keywords

extremal graph theoryquasirandom hypergraphsTurán's problem

Mathematics Subject Classification ID

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

Related Items (11)

Finite reflection groups and graph norms ⋮ Embedding tetrahedra into quasirandom hypergraphs ⋮ Extremal problems in uniformly dense hypergraphs ⋮ The codegree threshold of \(K_4^-\) ⋮ Uniform Turán density of cycles ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Restricted problems in extremal combinatorics ⋮ On the limit of the positive \(\ell\)-degree Turán problem ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ Two Erdős-Hajnal-type theorems in hypergraphs ⋮ Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large

This page was built for publication: On a Turán problem in weakly quasirandom 3-uniform hypergraphs