Many Turan exponents via subdivisions

Abstract

Given a graph H and a positive integer n, the Tur\'an number (n,H) is the maximum number of edges in an n-vertex graph that does not contain H as a subgraph. A real number r∈(1,2) is called a Tur\'an exponent if there exists a bipartite graph H such that (n,H)=(nr). A long-standing conjecture of Erdos and Simonovits states that 1+pq is a Tur\'an exponent for all positive integers p and q with q> 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+pq is a Tur\'an exponent for all positive integers p and q with q> p2.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…