Papers
Topics
Authors
Recent
Search
2000 character limit reached

Many Turan exponents via subdivisions

Published 6 Aug 2019 in math.CO | (1908.02385v1)

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 $r\in(1,2)$ is called a {\it Tur\'an exponent} if there exists a bipartite graph $H$ such that $\ex(n,H)=\Theta(nr)$. A long-standing conjecture of Erd\H{o}s and Simonovits states that $1+\frac{p}{q}$ 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+\frac{p}{q}$ is a Tur\'an exponent for all positive integers $p$ and $q$ with $q> p2$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.