On \(K_{s,t}\)-minors in graphs with given average degree. II

DOI10.1016/j.disc.2012.08.004zbMath1336.05126OpenAlexW4205775268MaRDI 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

zbMATH Keywords

dense graphsbipartite minors

Mathematics Subject Classification ID

Graph minors (05C83)

Related Items (7)

Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs ⋮ Some recent progress and applications in graph minor theory ⋮ Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth ⋮ Forcing a sparse minor ⋮ The extremal function for Petersen minors ⋮ Minors in ‐ Chromatic Graphs, II ⋮ Average degree conditions forcing a minor

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: On \(K_{s,t}\)-minors in graphs with given average degree. II