Many Turan exponents via subdivisions

DOI10.1017/S0963548322000177MaRDI QIDQ6323286arXivFDO

Authors Tao Jiang, Yu Qiu

Publication date 6 August 2019

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Abstract: Given a graph $H$ and a positive integer $n$, the {it Tur'an number} $ex(n,H)$ is the maximum number of edges in an $n$-vertex graph that does not contain $H$ as a subgraph. A real number $rin(1,2)$ is called a {it Tur'an exponent} if there exists a bipartite graph $H$ such that $ex(n,H)=Theta(n^r)$. A long-standing conjecture of ErdH{o}s and Simonovits states that $1+fracpq$ 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+fracpq$ is a Tur'an exponent for all positive integers $p$ and $q$ with $q>p^2$.

This page was built for publication: Many Turan exponents via subdivisions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6323286)