Rational exponents near two
David Conlon, Oliver Janzer

TL;DR
This paper advances the understanding of extremal graph theory by confirming a conjecture for a broad class of rational exponents near two, specifically those of the form 2 - a/b with large denominators.
Contribution
It proves the Erd ext{"o}s-Simonovits conjecture for all rationals of the form 2 - a/b with sufficiently large b, answering a question posed by Jiang, Jiang, and Ma.
Findings
The conjecture holds for all rationals of the form 2 - a/b with large b.
The result extends the class of rational exponents for which the extremal function is known.
Provides new techniques for analyzing extremal functions near the exponent 2.
Abstract
A longstanding conjecture of Erd\H{o}s and Simonovits states that for every rational between and there is a graph such that the largest number of edges in an -free graph on vertices is . Answering a question raised by Jiang, Jiang and Ma, we show that the conjecture holds for all rationals of the form with sufficiently large in terms of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · semigroups and automata theory
