Work

Hypergraphs with arbitrarily small codegree Turán density

Year: 2026

Type: article

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.

Source: Bulletin of the London Mathematical Society

DOI: 10.1112/blms.70348

Authors: Simón Piga, Bjarne Schülke

Institutions: Czech Academy of Sciences, Institute of Computer Science, Institute for Basic Science

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,930

Funder: Engineering and Physical Sciences Research Council