Rational exponents near two
Abstract
A longstanding conjecture of Erdos and Simonovits states that for every rational r between 1 and 2 there is a graph H such that the largest number of edges in an H-free graph on n vertices is (nr). Answering a question raised by Jiang, Jiang and Ma, we show that the conjecture holds for all rationals of the form 2 - a/b with b sufficiently large in terms of a.
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.