2000 character limit reached
Rational exponents near two
Published 7 Mar 2022 in math.CO | (2203.03375v2)
Abstract: A longstanding conjecture of Erd\H{o}s 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 $\Theta(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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.