An Improved Turán Exponent for 2‐Complexes

ABSTRACT The topological Turán number of a 2‐dimensional simplicial complex asks for the maximum number of edges in an ‐vertex 3‐uniform hypergraph containing no triangulation of as a subgraph. We prove that the Turán exponent of any such space is at most , that is, that for some constant . This improves on the previous exponent of , due to Keevash, Long, Narayanan, and Scott. Additionally, we present new streamlined proofs of the asymptotically tight upper bounds for the topological Turán 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 that are likely to bound a triangulation of the disk within a randomly‐selected subset of vertices.