Negligible obstructions and Tur\'an exponents
Combinatorics
2023-01-31 v3
Abstract
We show that for every rational number of the form , where satisfy , there exists a graph such that the Tur\'an number . Our result in particular generates infinitely many new Tur\'an exponents. As a byproduct, we formulate a framework that is taking shape in recent work on the Bukh--Conlon conjecture.
Keywords
Cite
@article{arxiv.2007.02975,
title = {Negligible obstructions and Tur\'an exponents},
author = {Tao Jiang and Zilin Jiang and Jie Ma},
journal= {arXiv preprint arXiv:2007.02975},
year = {2023}
}
Comments
23 pages, 5 figures, published in Annals of Applied Mathematics