On the size of hereditary classes of graphs
Journal of Combinatorial Theory Series B
The speed of hereditary properties of graphs
Journal of Combinatorial Theory Series B
The penultimate rate of growth for graph properties
European Journal of Combinatorics
Introduction to Algorithms
Journal of Combinatorial Theory Series B
A jump to the bell number for hereditary graph properties
Journal of Combinatorial Theory Series B
Proper minor-closed families are small
Journal of Combinatorial Theory Series B
Enumeration and limit laws for series-parallel graphs
European Journal of Combinatorics
Journal of Combinatorial Theory Series B
The unlabelled speed of a hereditary graph property
Journal of Combinatorial Theory Series B
Analytic Combinatorics
Random graphs from a minor-closed class
Combinatorics, Probability and Computing
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On graphs with few disjoint t-star minors
European Journal of Combinatorics
Hi-index | 0.00 |
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 G, let g"n be the number of graphs in G which have n vertices. The growth constant of G is @c=lim@?sup(g"n/n!)^1^/^n. We study the properties of the set @C of growth constants of minor-closed classes of graphs. Among other results, we show that @C does not contain any number in the interval [0,2], besides 0, 1, @x and 2, where @x~1.76. An infinity of further gaps is found by determining all the possible growth constants between 2 and @d~2.25159. Our results give in fact a complete characterization of all the minor-closed classes with growth constant at most @d in terms of their excluded minors.