OpenAlex ·

A proof of the rational exponents conjecture

David Conlon, Oliver Janzer, Tao Jiang, Jaehoon Kim, Joonkyung Lee, Hong Liu, Sean Longbrake and Liana Yepremyan

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.18713
Original
Read it at the publisher
Topics
CombinatoricsNumber Theory

Abstract

The rational exponents conjecture of Erdős and Simonovits asserts that for every rational $r\in [1,2]$ there exists a graph $H$ such that $\mathrm{ex}(n,H)=Θ(n^r)$. We present a proof of this conjecture claimed by Epoch AI, explaining how it builds upon ideas and methods developed by many researchers.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Combinatorics

Get the few papers worth your time in Combinatorics every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics