Erdős Problem #571: rational exponents for bipartite Turán numbers

Lineage and corrections

VibeMathed record: Erdős Problem #571: rational exponents for bipartite Turán numbers evidence for this event

For every rational $\alpha$ satisfying $$1\le\alpha<2,$$ the Lean theorem constructs some finite $q$ and a bipartite graph $$G:\operatorname{SimpleGraph}(\operatorname{Fin} q)$$ such that $$\operatorname{ex}(n;G)=\Theta(n^\alpha)$$ as $n\to\infty$. This resolves the single-graph rational-exponents conjecture. Earlier work of Bukh and Conlon proved the corresponding statement only for a finite family of forbidden bipartite graphs, and subsequent work realized many large classes of individual rational exponents. Astra's theorem covers every rational $\alpha\in[1,2)$ with one forbidden graph for each exponent. parent of this event

Erdős Problem #571: rational exponents for bipartite Turán numbers parent of this event

Erdős Problem #571: rational exponents for bipartite Turán numbers evidence for this event

erdosproblems.com/571: status and Thomas Bloom's proof exposition evidence for this event

Challenge.lean: the compared statement evidence for this event

Solution.lean and the Lean development evidence for this event

Epoch AI, Announcing FrontierMath Erdős (1 September 2026) evidence for this event

This event attributed to GPT-6 Astra (pre-release)

This event attributed to Tom Adamczewski