Densities of minor-closed graph classes are rational

Rohan Kapadia, Sergey Norin

For a graph class $\mathcal{F}$, let $e{x}_{\mathcal{F}}(n)$ denote the maximum number of edges in a graph in $\mathcal{F}$ on $n$ vertices. We show that for every proper minor-close…