Dense graphs have \(K_{3,t}\) minors

DOI10.1016/j.disc.2010.03.026zbMath1216.05149OpenAlexW2170136611MaRDI QIDQ709308

Alexandr V. Kostochka, Noah Prince

Publication date: 18 October 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.026

zbMATH Keywords

dense graphsbipartite minors

Mathematics Subject Classification ID

Graph minors (05C83) Density (toughness, etc.) (05C42)

Related Items (14)

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 ⋮ 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 ⋮ Forcing a sparse minor ⋮ The extremal function for Petersen minors ⋮ On \(K_{s,t}\)-minors in graphs with given average degree. II ⋮ Minors in ‐ Chromatic Graphs, II ⋮ On Ks,t minors in (s+t)-chromatic graphs ⋮ Hadwiger’s Conjecture ⋮ Extremal functions for sparse minors ⋮ Average degree conditions forcing a minor

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The edge-density for \(K_{2,t}\) minors
• Forcing unbalanced complete bipartite minors
• Lower bound of the Hadwiger number of graphs by their average degree
• On \(K_{s,t}\)-minors in graphs with given average degree
• The extremal function for unbalanced bipartite minors
• The extremal function for complete minors
• The extremal function for noncomplete minors
• On coverings
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• An extremal function for contractions of graphs
• On the existence of regular n-graphs with given girth

This page was built for publication: Dense graphs have \(K_{3,t}\) minors