Growth constants of minor-closed classes of graphs
From MaRDI portal
Publication:974473
DOI10.1016/J.JCTB.2010.03.001zbMATH Open1203.05145OpenAlexW2049665706MaRDI QIDQ974473FDOQ974473
Marc Noy, D. J. A. Welsh, Olivier Bernardi
Publication date: 3 June 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2010.03.001
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- Enumeration and limit laws for series-parallel graphs
- Asymptotic enumeration and limit laws of planar graphs
- Graph minors. XX: Wagner's conjecture
- Title not available (Why is that?)
- Random Graphs from a Minor-Closed Class
- On growth rates of permutations, set partitions, ordered graphs and other objects
- Random planar graphs
- Proper minor-closed families are small
- The speed of hereditary properties of graphs
- Random graphs on surfaces
- The number of graphs not containing \(K_{3,3}\) as a minor
- On the size of hereditary classes of graphs
- A jump to the Bell number for hereditary graph properties
- The penultimate rate of growth for graph properties
- On growth rates of closed permutation classes
- Small permutation classes
- The unlabelled speed of a hereditary graph property
- Title not available (Why is that?)
- PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188
- Graph minor hierarchies
- Hereditary properties of tournaments
Cited In (17)
- Random graphs from a weighted minor-closed class
- Random graphs containing few disjoint excluded minors
- Limits of random tree-like discrete structures
- Pendant appearances and components in random graphs from structured classes
- Asymptotic Properties of Some Minor-Closed Classes of Graphs
- On graphs with few disjoint \(t\)-star minors
- Title not available (Why is that?)
- Definability of Combinatorial Functions and Their Linear Recurrence Relations
- Logical limit laws for minor-closed classes of graphs
- 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
- 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
- Connectivity for Bridge-Addable Monotone Graph Classes
- A sharp bound for the growth of minimal graphs
Recommendations
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)