English

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 rr between 11 and 22 there is a graph HH such that the largest number of edges in an HH-free graph on nn vertices is Θ(nr)\Theta(n^r). Answering a question raised by Jiang, Jiang and Ma, we show that the conjecture holds for all rationals of the form 2a/b2 - a/b with bb sufficiently large in terms of aa.

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

R2 v1 2026-06-24T10:04:32.031Z