Rational Exponents for Generalized Tur\'an Numbers
Abstract
The generalized Tur\'an number ex(n,H,F) denotes the maximum number of copies of H in an n-vertex graph which contains no copies of any graph in a family F of graphs. The generalized rational exponents conjecture states that for every rational r≥ 1 there exist graphs H,F such that ex(n,H,\F\)=(nr). We extend a result of Bukh and Conlon to show that for every non-empty graph H on v≥ 2 vertices and every rational r in the interval [v-1,v] there exists a finite family Fr such that ex(n,H,Fr)=(nr).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.