Rational exponents near two
Combinatorics
2022-12-26 v2
Abstract
A longstanding conjecture of Erd\H{o}s and Simonovits states that for every rational between and there is a graph such that the largest number of edges in an -free graph on vertices is . Answering a question raised by Jiang, Jiang and Ma, we show that the conjecture holds for all rationals of the form with sufficiently large in terms of .
Keywords
Cite
@article{arxiv.2203.03375,
title = {Rational exponents near two},
author = {David Conlon and Oliver Janzer},
journal= {arXiv preprint arXiv:2203.03375},
year = {2022}
}
Comments
10 pages