On the growth rate of minor-closed classes of graphs
Abstract
A minor-closed class of graphs is a set of labelled graphs which is closed under isomorphism and under taking minors. For a minor-closed class C, we let cn be the number of graphs in C which have n vertices. A recent result of Norine et al. shows that for all minor-closed class C, there is a constant r such that cn < rn n!. Our main results show that the growth rate of cn is far from arbitrary. For example, no minor-closed class C has cn= rn+o(n) n! with 0 < r < 1 or 1 < r < ≈ 1.76.
0