English

An Improved Tur\'an Exponent for 2-Complexes

Combinatorics 2026-05-14 v2

Abstract

The topological Tur\'an number exhom(n,X)\mathrm{ex}_{\hom}(n,X) of a 2-dimensional simplicial complex XX asks for the maximum number of edges in an nn-vertex 3-uniform hypergraph containing no triangulation of XX as a subgraph. We prove that the Tur\'an exponent of any such space XX is at most 8/38/3, i.e., that exhom(n,X)Cn8/3\mathrm{ex}_{\hom}(n,X)\leq Cn^{8/3} for some constant C=C(X)C=C(X). This improves on the previous exponent of 31/53-1/5, due to Keevash, Long, Narayanan, and Scott. Additionally, we present new streamlined proofs of the asymptotically tight upper bounds for the topological Tur\'an numbers of the torus and real projective plane, which can be used to derive asymptotically tight upper bounds for all surfaces. The key insight is an improved understanding of the placement of 4-cycles vwvwvwv'w' that are likely to bound a triangulation of the disk within a randomly-selected subset of vertices.

Keywords

Cite

@article{arxiv.2408.09029,
  title  = {An Improved Tur\'an Exponent for 2-Complexes},
  author = {Maya Sankar},
  journal= {arXiv preprint arXiv:2408.09029},
  year   = {2026}
}

Comments

17 pages

R2 v1 2026-06-28T18:15:13.290Z