Forcing unbalanced complete bipartite minors

DOI10.1016/J.EJC.2004.02.002MaRDI QIDQ703605zbMATHOpenAlexFDO

Authors 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)

Recommendations

• The extremal function for unbalanced bipartite minors
• Unbalanced bipartite factorizations of complete bipartite graphs
• Bounds on the forcing numbers of bipartite graphs
• On minimum balanced bipartitions of triangle-free graphs
• Disjoint complete minors and bipartite minors
• On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite
• Linear connectivity forces large complete bipartite minors
• Forcing large complete (topological) minors in infinite graphs
• scientific article; zbMATH DE number 1303530
• On the forced matching numbers of bipartite graphs

Cites work

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

Cited in

(28)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703605)