An Improved Turán Exponent for 2-Complexes

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Sankar, Maya
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866917489220255744
author Sankar, Maya
author_facet Sankar, Maya
contents The topological Turán number $\mathrm{ex}_{\hom}(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 $\mathrm{ex}_{\hom}(n,X)\leq Cn^{8/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.
format Preprint
id arxiv_https___arxiv_org_abs_2408_09029
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle An Improved Turán Exponent for 2-Complexes
Sankar, Maya
Combinatorics
05E45 (Primary), 05C65, 05C36
The topological Turán number $\mathrm{ex}_{\hom}(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 $\mathrm{ex}_{\hom}(n,X)\leq Cn^{8/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.
title An Improved Turán Exponent for 2-Complexes
topic Combinatorics
05E45 (Primary), 05C65, 05C36
url https://arxiv.org/abs/2408.09029