Dense graphs have K₃,t minors

DOI10.1016/J.DISC.2010.03.026MaRDI QIDQ709308zbMATH OpenOpenAlexFDO

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

bipartite minorsdense graphs

Mathematics Subject Classification ID

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

Recommendations

• \(K_{s,t}\) minors in \((s+t)\)-chromatic graphs. II
• On \(K_{s,t}\) minors in \((s+t)\)-chromatic graphs
• The edge-density for \(K_{2,t}\) minors
• Small minors in dense graphs
• Complete minors in \(K_{s,s}\)-free graphs

Cites work

• An extremal function for contractions of graphs
• Forcing unbalanced complete bipartite minors
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• scientific article; zbMATH DE number 3865318 (Why is no real title available?)
• scientific article; zbMATH DE number 3695222 (Why is no real title available?)
• scientific article; zbMATH DE number 1870233 (Why is no real title available?)
• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• List colourings of graphs
• Lower bound of the Hadwiger number of graphs by their average degree
• On \(K_{s,t}\)-minors in graphs with given average degree
• On coverings
• On the existence of regular n-graphs with given girth
• The edge-density for \(K_{2,t}\) minors
• The extremal function for complete minors
• The extremal function for noncomplete minors
• The extremal function for unbalanced bipartite minors

Cited in

(26)

• The extremal function for Petersen minors
• On \(K_{s,t}\)-minors in graphs with given average degree. II
• The circumference of a graph with no \(K_{3,t}\)-minor. II
• Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs
• A lower bound on the average degree forcing a minor
• The extremal function for disconnected minors
• Average degree conditions forcing a minor
• Hadwiger's conjecture
• On \(K_{s,t}\) minors in \((s+t)\)-chromatic graphs
• Cycles of Given Size in a Dense Graph
• Forcing a sparse minor
• \(K_{s,t}\) minors in \((s+t)\)-chromatic graphs. II
• Extremal functions for sparse minors
• Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
• The edge-density for \(K_{2,t}\) minors
• Recent progress towards Hadwiger's conjecture
• Product structure extension of the Alon-Seymour-Thomas theorem
• Local degree conditions for \({K}_9\)-minors in graphs
• Biclique immersions in graphs with independence number 2
• On the choosability of \(H\)-minor-free graphs
• Product structure of graph classes with bounded treewidth
• Minors in small-set expanders
• Complete bipartite immersion in graphs with independence number two: a simple proof
• Seymour and Woodall's conjecture holds for graphs with independence number two
• Biclique immersions in graphs with independence number 2 (extended abstract)
• Odd complete bipartite minors in graphs with independence number two

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

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