Many Turan exponents via subdivisions
Combinatorics
2019-08-08 v1
Abstract
Given a graph and a positive integer , the {\it Tur\'an number} 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\'an exponent} if there exists a bipartite graph such that . A long-standing conjecture of Erd\H{o}s and Simonovits states that is a Tur\'an 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\'an exponents. In particular, it follows from our main result that is a Tur\'an exponent for all positive integers and with .
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