On the extremal function for graph minors
From MaRDI portal
Publication:6081888
DOI10.1002/jgt.22811zbMath1522.05461arXiv1907.11626MaRDI QIDQ6081888
Andrew G. Thomason, Matthew Wales
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.11626
Related Items
Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth, Phase transition of degeneracy in minor-closed families, Extremal functions for sparse minors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bound of the Hadwiger number of graphs by their average degree
- Hadwiger's conjecture is true for almost every graph
- Spanning subgraphs of random graphs
- The extremal function for complete minors
- A lower bound on the average degree forcing a minor
- The extremal function for noncomplete minors
- Homomorphiesätze für Graphen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- An extremal function for contractions of graphs
- Forcing a sparse minor
- ‘Forcing a sparse minor’ — CORRIGENDUM
- Extremal functions for sparse minors