paper

On the codegree Turán density of projective geometries

arXiv:2607.09173

Abstract

Let be a -uniform hypergraph, abbreviated as -graph. The codegree Turán density is the supremum over all such that, for arbitrarily large , there exists an -vertex -free -graph whose every -subset of vertices lies in at least edges. Let be the projective geometry of dimension over finite field . In this paper, we prove that for all and , where is the smallest prime divisor of . This resolves an open problem proposed by Keevash and Zhao (JCT-B, 2007). Moreover, we determine the exact codegree Turán density of when is an odd prime power.