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

DOI10.1016/j.disc.2007.08.041zbMath1171.05047MaRDI QIDQ941384

Noah Prince, Alexandr V. Kostochka

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.041

zbMATH Keywords

complete bipartite graphs; average degree; graph minors

Mathematics Subject Classification ID

05C83: Graph minors

Related Items

Forcing a sparse minor, Minors in ‐ Chromatic Graphs, II, Extremal functions for sparse minors, Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth, Average degree conditions forcing a minor, Small minors in dense graphs, The edge-density for \(K_{2,t}\) minors, Forcing unbalanced complete bipartite minors, Dense graphs have \(K_{3,t}\) minors, Disjoint unions of complete minors, Linear connectivity forces large complete bipartite minors, List-coloring graphs without \(K_{4,k}\)-minors, The extremal function for Petersen minors, On \(K_{s,t}\)-minors in graphs with given average degree. II, Rooted minor problems in highly connected graphs, The Colin de Verdière parameter, excluded minors, and the spectral radius, Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs, A lower bound on the average degree forcing a minor, Asymptotic density of graphs excluding disconnected minors, Disjoint complete minors and bipartite minors, The extremal function for disconnected minors, Cycles of Given Size in a Dense Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forcing unbalanced complete bipartite minors
• Lower bound of the Hadwiger number of graphs by their 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
• An extremal function for contractions of graphs