On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs

DOI10.1093/imrn/rnx017zbMath1404.05141arXiv1607.07068OpenAlexW3099640509MaRDI QIDQ4619424

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

Publication date: 6 February 2019

Published in: International Mathematics Research Notices (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-uniform hypergraphTurán density

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Density (toughness, etc.) (05C42)

Related Items (9)

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 ⋮ 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 ⋮ Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs

This page was built for publication: On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs