The Turán number of surfaces
Abstract We show that there is a constant such that any 3‐uniform hypergraph with vertices and at least edges contains a triangulation of the real projective plane as a subgraph. This resolves a conjecture of Kupavskii, Polyanskii, Tomon and Zakharov. Furthermore, our work, combined with prior results, asymptotically determines the Turán number of all surfaces.
Authors
- Maya Sankar (ORCID: https://orcid.org/0009-0004-8763-431X)
Institutions
- Stanford University (US)
Publication Details
- Journal
- Bulletin of the London Mathematical Society
- Published
- 2024-10-18
- DOI
- https://doi.org/10.1112/blms.13167
- Citations
- 1
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 1.32
Funders
- National Science Foundation
- Hertz Foundation