2000 character limit reached
Negligible obstructions and Turán exponents
Published 6 Jul 2020 in math.CO | (2007.02975v3)
Abstract: We show that for every rational number $r \in (1,2)$ of the form $2 - a/b$, where $a, b \in \mathbb{N}+$ satisfy $\lfloor b/a \rfloor3 \le a \le b / (\lfloor b/a \rfloor +1) + 1$, there exists a graph $F_r$ such that the Tur\'an number $\operatorname{ex}(n, F_r) = \Theta(nr)$. Our result in particular generates infinitely many new Tur\'an exponents. As a byproduct, we formulate a framework that is taking shape in recent work on the Bukh--Conlon conjecture.
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.