English

On the codegree Turán density of projective geometries

Combinatorics 2026-07-10 v1

Abstract

Let FF be a kk-uniform hypergraph, abbreviated as kk-graph. The codegree Tur\'an density γ(F)\gamma(F) is the supremum over all γ[0,1)\gamma \in [0,1) such that, for arbitrarily large nn, there exists an nn-vertex FF-free kk-graph HH whose every (k1)(k-1)-subset of vertices lies in at least γn\gamma n edges. Let PGm(q)PG_m(q) be the projective geometry of dimension mm over finite field Fq\mathbb{F}_q. In this paper, we prove that γ(PGm(q))1p>0\gamma(PG_m(q)) \ge \frac{1}{p}> 0 for all mm and qq, where pp is the smallest prime divisor of q+1q+1. This resolves an open problem proposed by Keevash and Zhao (JCT-B, 2007). Moreover, we determine the exact codegree Tur\'an density of PG4(q)PG_4(q) when qq is an odd prime power.

Keywords

Cite

@article{arxiv.2607.09173,
  title  = {On the codegree Turán density of projective geometries},
  author = {Xiaona Fang and Yaojun Chen},
  journal= {arXiv preprint arXiv:2607.09173},
  year   = {2026}
}