arXiv Analytics

Sign in

arXiv:0710.2995 [math.CO]AbstractReferencesReviewsResources

On the growth rate of minor-closed classes of graphs

Olivier Bernardi, Marc Noy, Dominic Welsh

Published 2007-10-16Version 1

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 $c_n$ 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 $c_n < r^n n!$. Our main results show that the growth rate of $c_n$ is far from arbitrary. For example, no minor-closed class $C$ has $c_n= r^{n+o(n)} n!$ with $0 < r < 1$ or $1 < r < \xi \approx 1.76$.

Related articles: Most relevant | Search more
arXiv:2406.04753 [math.CO] (Published 2024-06-07)
Differential equations satisfied by generating functions of 5-, 6-, and 7-regular labelled graphs: a reduction-based approach
arXiv:0912.4670 [math.CO] (Published 2009-12-23, updated 2010-03-14)
Asymptotic enumeration of labelled graphs with a given genus
arXiv:1405.6802 [math.CO] (Published 2014-05-27)
On the growth rate of 1324-avoiding permutations