The extremal function for unbalanced bipartite minors

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

Joseph Samuel Myers

Publication date: 25 September 2003

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

zbMATH Keywords

extremal problems; graph minors

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C83: Graph minors

Related Items

Forcing a sparse minor, Minors in ‐ Chromatic Graphs, II, Average degree conditions forcing a minor, Small minors in dense graphs, The edge-density for \(K_{2,t}\) minors, Topological minors in bipartite graphs, Forcing unbalanced complete bipartite minors, Dense graphs have \(K_{3,t}\) minors, Some recent progress and applications in graph minor theory, Disjoint unions of complete minors, On \(K_{s,t}\)-minors in graphs with given average degree, Linear connectivity forces large complete bipartite minors, List-coloring graphs without \(K_{4,k}\)-minors, On \(K_{s,t}\)-minors in graphs with given average degree. II, Disjoint complete minors and bipartite minors, A Characterization of $K_{2,4}$-Minor-Free Graphs, Hadwiger’s Conjecture, On Ks,t minors in (s+t)-chromatic graphs, Cycles of Given Size in a Dense Graph

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