On the growth rate of minor-closed classes of graphs
Combinatorics
2007-10-17 v1
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 , we let be the number of graphs in which have vertices. A recent result of Norine et al. shows that for all minor-closed class , there is a constant such that . Our main results show that the growth rate of is far from arbitrary. For example, no minor-closed class has with or .
Cite
@article{arxiv.0710.2995,
title = {On the growth rate of minor-closed classes of graphs},
author = {Olivier Bernardi and Marc Noy and Dominic Welsh},
journal= {arXiv preprint arXiv:0710.2995},
year = {2007}
}