The graph $a$-Turán theorem
We prove analogues of Turán's theorem and the Erdős--Stone theorem for graph $a$-numbers. The $i$th $a$-number $a_i(G)$ equals the $i$th rational Betti number of the real toric manifold associated with the graph associahedron of $G$. We show that the Turán graph $T_r(n)$ maximizes every $a$-number among $K_{r+1}$-free graphs on $n$ vertices. We also show that for any fixed graph $H$ with at least one edge and each fixed $i\geq1$, the limiting extremal density of the $i$th $a$-number among $H$-free graphs depends only on the chromatic number of $H$. Since $a_1(G)$ is the number of edges of $G$, these results recover the two classical theorems in degree one and extend them to higher $a$-numbers.
Authors
- Younghan Yoon (ORCID: https://orcid.org/0009-0001-2603-8205)
- Suyoung Choi
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.48550/arxiv.2611.16262
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- preprint