English

Many Turan exponents via subdivisions

Combinatorics 2019-08-08 v1

Abstract

Given a graph HH and a positive integer nn, the {\it Tur\'an number} \ex(n,H)\ex(n,H) is the maximum number of edges in an nn-vertex graph that does not contain HH as a subgraph. A real number r(1,2)r\in(1,2) is called a {\it Tur\'an exponent} if there exists a bipartite graph HH such that \ex(n,H)=Θ(nr)\ex(n,H)=\Theta(n^r). A long-standing conjecture of Erd\H{o}s and Simonovits states that 1+pq1+\frac{p}{q} is a Tur\'an exponent for all positive integers pp and qq with q>pq> p. In this paper, we build on recent developments on the conjecture to establish a large family of new Tur\'an exponents. In particular, it follows from our main result that 1+pq1+\frac{p}{q} is a Tur\'an exponent for all positive integers pp and qq with q>p2q> p^2.

Keywords

Cite

@article{arxiv.1908.02385,
  title  = {Many Turan exponents via subdivisions},
  author = {Tao Jiang and Yu Qiu},
  journal= {arXiv preprint arXiv:1908.02385},
  year   = {2019}
}

Comments

20 pages

R2 v1 2026-06-23T10:41:32.417Z