Hypergraphs with arbitrarily small codegree Turán density
Abstract
Abstract The codegree Turán density of a ‐graph is the smallest such that every ‐graph with contains a copy of . In this work, we show that for every , there is a ‐uniform hypergraph with . The initial preprint of this work leads to significant subsequent research on accumulation points of variants of the Turán density.
Fields of Study & Subjects
Limits and Structures in Graph Theory
Advanced Graph Theory Research
Markov Chains and Monte Carlo Methods
Publication details
- Journal / source
- Bulletin of the London Mathematical Society
- Publisher
- Wiley
- Volume
- 58
- Issue
- 4
- Publication date
- 27 March 2026
- Language
- EN