Rational Exponents for Generalized Tur\'an Numbers
Combinatorics
2025-10-27 v2
Abstract
The generalized Tur\'an number denotes the maximum number of copies of in an -vertex graph which contains no copies of any graph in a family of graphs. The generalized rational exponents conjecture states that for every rational there exist graphs such that . We extend a result of Bukh and Conlon to show that for every non-empty graph on vertices and every rational in the interval there exists a finite family such that .
Keywords
Cite
@article{arxiv.2510.19621,
title = {Rational Exponents for Generalized Tur\'an Numbers},
author = {Bas van der Beek and Anurag Bishnoi},
journal= {arXiv preprint arXiv:2510.19621},
year = {2025}
}
Comments
The main result is false as the lower bound fails due to a calculation error at the top of page 7 where N=q^b is used instead of the correct N=q^{be}