Hypergraphs with arbitrarily small codegree Turán density
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.
Authors
- Simón Piga (ORCID: https://orcid.org/0000-0003-4451-7821)
- Bjarne Schülke (ORCID: https://orcid.org/0000-0003-1621-4030)
Institutions
- Institute for Basic Science (KR)
- Czech Academy of Sciences, Institute of Computer Science (CZ)
Publication Details
- Journal
- Bulletin of the London Mathematical Society
- Published
- 2026-03-27
- DOI
- https://doi.org/10.1112/blms.70348
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00