On the Generalized Rational Exponents Conjecture
For fixed graphs $H$ and $F$, let $\ex(n,H,F)$ denote the maximum number of copies of $H$ in an $n$-vertex $F$-free graph. In this note, we prove the generalized rational exponents conjecture, posed by Gerbner and Palmer, showing that for every rational number $\alpha\ge1$, there exist fixed graphs $H_\alpha$ and $F_\a...