An Improved Turán Exponent for 2-Complexes

Abstract

The topological Turán number ex(n,X) of a 2-dimensional simplicial complex X asks for the maximum number of edges in an n-vertex 3-uniform hypergraph containing no triangulation of X as a subgraph. We prove that the Turán exponent of any such space X is at most 8/3, i.e., that ex(n,X)≤ Cn8/3 for some constant C=C(X). This improves on the previous exponent of 3-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á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 vwv'w' that are likely to bound a triangulation of the disk within a randomly-selected subset of vertices.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…