A proof of the rational exponents conjecture
David Conlon, Oliver Janzer, Tao Jiang, Jaehoon Kim, Joonkyung Lee, Hong Liu, Sean Longbrake, Liana Yepremyan
Abstract
The rational exponents conjecture of Erdős and Simonovits asserts that for every rational r∈ [1,2] there exists a graph H such that ex(n,H)=Θ(nr). We present a proof of this conjecture claimed by Epoch AI, explaining how it builds upon ideas and methods developed by many researchers.
Create a lesson
Related papers
Szemerédi's theorem with random differences and arithmetic Kakeya
Gabriel Dahia
Proofs of four Takigiku--Tsuchioka conjectures on level 2 principal characters of A2-1(2)
Liuquan Wang
Two conjectures on the cospectrality of complete tripartite graphs are false
Irena M. Jovanović, Jelena Sedlar, Riste Škrekovski
Saturation and semisaturation of oriented graphs
Vladimir Bošković, Balázs Keszegh
Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity
Jia Wei, Muhuo Liu, Zhifu You et al.
High-Arity Rademacher Complexity and Uniform Laws of Large Numbers
Aaron Anderson, Henry Towsner