Growth constants of minor-closed classes of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 47603 (Why is no real title available?)
- A jump to the Bell number for hereditary graph properties
- Analytic combinatorics
- Asymptotic enumeration and limit laws of planar graphs
- Enumeration and limit laws for series-parallel graphs
- Graph minor hierarchies
- Graph minors. XX: Wagner's conjecture
- Hereditary properties of ordered graphs
- Hereditary properties of tournaments
- Introduction to algorithms
- On growth rates of closed permutation classes
- On growth rates of permutations, set partitions, ordered graphs and other objects
- On the size of hereditary classes of graphs
- PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188
- Proper minor-closed families are small
- Random graphs from a minor-closed class
- Random graphs on surfaces
- Random planar graphs
- Small permutation classes
- The number of graphs not containing \(K_{3,3}\) as a minor
- The penultimate rate of growth for graph properties
- The speed of hereditary properties of graphs
- The unlabelled speed of a hereditary graph property
Cited in
(20)- Random graphs from a weighted minor-closed class
- Limits of random tree-like discrete structures
- Random graphs containing few disjoint excluded minors
- Asymptotic Properties of Some Minor-Closed Classes of Graphs
- On graphs with few disjoint \(t\)-star minors
- Pendant appearances and components in random graphs from structured classes
- scientific article; zbMATH DE number 2197898 (Why is no real title available?)
- Logical limit laws for minor-closed classes of graphs
- Connectivity for Bridge-addable monotone graph classes
- Small but unwieldy: a lower bound on adjacency labels for small classes
- Graph classes with given 3-connected components: asymptotic enumeration and random graphs
- Arkhipov's theorem, graph minors, and linear system nonlocal games
- Unprovability threshold for the planar graph minor theorem
- On the critical densities of minor-closed classes
- The rate of growth of the minimum clique size of graphs of given order and chromatic number
- A Bernstein result for minimal graphs of controlled growth
- Definability of combinatorial functions and their linear recurrence relations
- Proper minor-closed families are small
- A sharp bound for the growth of minimal graphs
- On the purity of minor-closed classes of graphs
This page was built for publication: Growth constants of minor-closed classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974473)