The extremal function for unbalanced bipartite minors

DOI10.1016/S0012-365X(03)00051-7zbMath1022.05077OpenAlexW2065163524MaRDI QIDQ1408877

Joseph Samuel Myers

Publication date: 25 September 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00051-7

zbMATH Keywords

extremal problemsgraph minors

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph minors (05C83)

Related Items (27)

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 ⋮ Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait ⋮ Some recent progress and applications in graph minor theory ⋮ The edge-density for \(K_{2,t}\) minors ⋮ A lower bound on the average degree forcing a minor ⋮ Maximum spread of \(K_{2,t}\)-minor-free graphs ⋮ Recent progress towards Hadwiger's conjecture ⋮ Small minors in dense graphs ⋮ Forcing a sparse minor ⋮ Topological minors in bipartite 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 Colin de Verdière parameter, excluded minors, and the spectral radius ⋮ On \(K_{s,t}\)-minors in graphs with given average degree. II ⋮ Minors in ‐ Chromatic Graphs, II ⋮ Forcing unbalanced complete bipartite minors ⋮ Dense graphs have \(K_{3,t}\) minors ⋮ On Ks,t minors in (s+t)-chromatic graphs ⋮ A Characterization of $K_{2,4}$-Minor-Free Graphs ⋮ 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
• Unnamed Item
• Lower bound of the Hadwiger number of graphs by their average degree
• On the maximum density of graphs which have no subcontraction to \(K^ r\).
• Hadwiger's conjecture is true for almost every graph
• The extremal function for complete minors
• The extremal function for noncomplete minors
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Highly linked graphs
• An extremal function for contractions of graphs

This page was built for publication: The extremal function for unbalanced bipartite minors