English

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 CC, we let cnc_n be the number of graphs in CC which have nn vertices. A recent result of Norine et al. shows that for all minor-closed class CC, there is a constant rr such that cn<rnn!c_n < r^n n!. Our main results show that the growth rate of cnc_n is far from arbitrary. For example, no minor-closed class CC has cn=rn+o(n)n!c_n= r^{n+o(n)} n! with 0<r<10 < r < 1 or 1<r<ξ1.761 < r < \xi \approx 1.76.

Keywords

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}
}