paper

Many Turan exponents via subdivisions

arXiv:1908.02385

Abstract

Given a graph and a positive integer , the {\it Turán number} $\ex(n,H)$ is the maximum number of edges in an -vertex graph that does not contain as a subgraph. A real number is called a {\it Turán exponent} if there exists a bipartite graph such that $\ex(n,H)=Θ(n^r)$. A long-standing conjecture of Erdős and Simonovits states that is a Turán exponent for all positive integers and with . In this paper, we build on recent developments on the conjecture to establish a large family of new Turán exponents. In particular, it follows from our main result that is a Turán exponent for all positive integers and with .

20 pages

Many Turan exponents via subdivisions · wovepaper