On the growth rate of minor-closed classes of graphs

Details On the growth rate of minor-closed classes of graphs On the growth rate of minor-closed classes of graphs

2007-10-16

arxiv.org/abs/0710.2995v1

Mathematics

Combinatorics

Scientific paper

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$.

Affiliated with

Also associated with

No associations

Rating

On the growth rate of minor-closed classes of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the growth rate of minor-closed classes of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the growth rate of minor-closed classes of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-714219