Forcing unbalanced complete bipartite minors

DOI10.1016/j.ejc.2004.02.002zbMath1061.05087OpenAlexW1979717362MaRDI QIDQ703605

Daniela Kühn, Deryk Osthus

Publication date: 11 January 2005

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.02.002

zbMATH Keywords

average degreecomplete bipartite minor

Mathematics Subject Classification ID

Graph minors (05C83)

Related Items (23)

Rooted minor problems in highly connected graphs ⋮ Disjoint complete minors and bipartite minors ⋮ Cycles of Given Size in a Dense Graph ⋮ Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs ⋮ The extremal function for disconnected minors ⋮ Some recent progress and applications in graph minor theory ⋮ A lower bound on the average degree forcing a minor ⋮ Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth ⋮ Recent progress towards Hadwiger's conjecture ⋮ Small minors in dense graphs ⋮ Forcing a sparse minor ⋮ A note on the saturation number of the family of \(k\)-connected graphs ⋮ Asymptotic density of graphs excluding disconnected minors ⋮ Disjoint unions of complete minors ⋮ On \(K_{s,t}\)-minors in graphs with given average degree ⋮ The extremal function for Petersen minors ⋮ On \(K_{s,t}\)-minors in graphs with given average degree. II ⋮ Dense graphs have \(K_{3,t}\) minors ⋮ Hadwiger’s Conjecture ⋮ Linear connectivity forces large complete bipartite minors ⋮ List-coloring graphs without \(K_{4,k}\)-minors ⋮ Extremal functions for sparse minors ⋮ Average degree conditions forcing a minor

Cites Work

• Unnamed Item
• Lower bound of the Hadwiger number of graphs by their average degree
• On \(K_{s,t}\)-minors in graphs with given average degree
• Hadwiger's conjecture is true for almost every graph
• The extremal function for unbalanced bipartite minors
• An improved linear edge bound for graph linkages
• The extremal function for complete minors
• The extremal function for noncomplete minors
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Highly linked graphs
• An extremal function for contractions of graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked

This page was built for publication: Forcing unbalanced complete bipartite minors