The extremal function for \(K_{9}\) minors

DOI10.1016/j.jctb.2005.07.008zbMath1085.05056OpenAlexW1997241423MaRDI QIDQ2490252

Zi-Xia Song, Robin Thomas

Publication date: 28 April 2006

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2005.07.008

zbMATH Keywords

complete graph minor

Mathematics Subject Classification ID

Graph minors (05C83)

Related Items (28)

The extremal functions for triangle-free graphs with excluded minors ⋮ On the critical densities of minor-closed classes ⋮ Cliques in graphs excluding a complete graph minor ⋮ The extremal function for disconnected minors ⋮ Coloring graphs with forbidden minors ⋮ Some recent progress and applications in graph minor theory ⋮ Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets ⋮ A note on uniquely 10‐colorable graphs ⋮ A lower bound on the average degree forcing a minor ⋮ Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth ⋮ A decomposition method on solving the linear arboricity conjecture ⋮ On a recolouring version of Hadwiger's conjecture ⋮ A note on odd colorings of 1-planar graphs ⋮ Recent progress towards Hadwiger's conjecture ⋮ The spectral radius of minor-free graphs ⋮ Forcing a sparse minor ⋮ On the Fiedler value of large planar graphs ⋮ Asymptotic density of graphs excluding disconnected minors ⋮ The extremal functions of classes of matroids of bounded branch-width ⋮ The extremal function for Petersen minors ⋮ The extremal function and Colin de Verdière graph parameter ⋮ Unnamed Item ⋮ Hadwiger’s Conjecture ⋮ Linear connectivity forces large complete bipartite minors ⋮ Cliques, minors and apex graphs ⋮ A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two ⋮ Extremal functions for sparse minors ⋮ Average degree conditions forcing a minor

Cites Work

• Lower bound of the Hadwiger number of graphs by their average degree
• Linear connectivity forces large complete bipartite minors
• On the maximum density of graphs which have no subcontraction to \(K^ r\).
• On the edge numbers of graphs with Hadwiger number 4 and 5
• Hadwiger's conjecture is true for almost every graph
• Disjoint paths in graphs
• 2-linked graphs
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• An improved linear edge bound for graph linkages
• The extremal function for complete minors
• Homomorphiesätze für Graphen
• Über trennende Eckenmengen in homomorphiekritischen Graphen
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• The extremal function for \(K_{8}^{-}\) minors
• Homomorphism theorems for graphs
• An extremal function for contractions of graphs
• On a certain homomorphism properties of graphs II.
• Contractions to k₈
• Graph minors and linkages
• On Certain Homomorphism Properties of Graphs I.
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Vertex partitions of \(K_{4,4}\)-minor free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The extremal function for \(K_{9}\) minors