A lower bound on the average degree forcing a minor
From MaRDI portal
Publication:2189420
DOI10.37236/8847zbMath1442.05218arXiv1907.01202OpenAlexW2956003067MaRDI QIDQ2189420
David R. Wood, Serguei Norine, Andrew G. Thomason, Bruce A. Reed
Publication date: 15 June 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.01202
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Graph minors (05C83) Density (toughness, etc.) (05C42)
Related Items
On the extremal function for graph minors, Phase transition of degeneracy in minor-closed families, Recent progress towards Hadwiger's conjecture, Asymptotic density of graphs excluding disconnected minors, Extremal functions for sparse minors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Average degree conditions forcing a minor
- The edge-density for \(K_{2,t}\) minors
- Forcing unbalanced complete bipartite minors
- Dense graphs have \(K_{3,t}\) minors
- Lower bound of the Hadwiger number of graphs by their average degree
- Disjoint unions of complete minors
- On \(K_{s,t}\)-minors in graphs with given average degree
- On the maximum density of graphs which have no subcontraction to \(K^ r\).
- Hadwiger's conjecture is true for almost every graph
- Spanning subgraphs of random graphs
- The extremal function for unbalanced bipartite minors
- The extremal function for Petersen minors
- The extremal function for complete minors
- The extremal function for noncomplete minors
- The extremal function for disconnected minors
- The extremal function for \(K_{9}\) minors
- Homomorphiesätze für Graphen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Homomorphism theorems for graphs
- An extremal function for contractions of graphs
- Cycles of Given Size in a Dense Graph
- Contractions to k8
- Forcing a sparse minor
- Probability and Computing
