On the purity of minor-closed classes of graphs
From MaRDI portal
Publication:1719590
DOI10.1016/j.jctb.2018.08.010zbMath1404.05202arXiv1608.08623OpenAlexW2962774592WikidataQ129298654 ScholiaQ129298654MaRDI QIDQ1719590
Michał Przykucki, Colin J. H. McDiarmid
Publication date: 8 February 2019
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.08623
Related Items (2)
Edge‐maximal graphs on orientable and some nonorientable surfaces ⋮ On the purity of minor-closed classes of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- Lower bound of the Hadwiger number of graphs by their average degree
- Small graph classes and bounded expansion
- On the maximum density of graphs which have no subcontraction to \(K^ r\).
- On the purity of minor-closed classes of graphs
- The extremal function for complete minors
- The extremal function for noncomplete minors
- The extremal function for disconnected minors
- Proper minor-closed families are small
- Homomorphiesätze für Graphen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- A Maximal Toroidal Graph which is not a Triangulation.
- Random Graphs from a Minor-Closed Class
- Edge-Maximal Graphs on Surfaces
- Forcing a sparse minor
- On the maximal number of independent circuits in a graph
This page was built for publication: On the purity of minor-closed classes of graphs
