On \(K_{s,t}\)-minors in graphs with given average degree. II
From MaRDI portal
Publication:1759392
DOI10.1016/j.disc.2012.08.004zbMath1336.05126MaRDI QIDQ1759392
Noah Prince, Alexandr V. Kostochka
Publication date: 20 November 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.08.004
05C83: Graph minors
Related Items
Forcing a sparse minor, Minors in ‐ Chromatic Graphs, II, Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth, Average degree conditions forcing a minor, Some recent progress and applications in graph minor theory, The extremal function for Petersen minors, Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- On \(K_{s,t}\)-minors in graphs with given average degree
- The extremal function for unbalanced bipartite minors
- The extremal function for complete minors
- The extremal function for noncomplete minors
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- On Ks,t minors in (s+t)-chromatic graphs
- An extremal function for contractions of graphs