Dense graphs have K₃,t minors

DOI10.1016/J.DISC.2010.03.026zbMATH Open1216.05149OpenAlexW2170136611MaRDI QIDQ709308FDOQ709308

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

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

zbMATH Keywords

dense graphsbipartite minors

Mathematics Subject Classification ID

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

Cites Work

• The extremal function for unbalanced bipartite minors
• The extremal function for complete minors
• The extremal function for noncomplete minors
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Title not available (Why is that?)
• An extremal function for contractions of graphs
• 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
• List colourings of graphs
• On the existence of regular n-graphs with given girth
• Title not available (Why is that?)
• Title not available (Why is that?)
• On coverings
• Title not available (Why is that?)

Cited In (19)

• The extremal function for disconnected minors
• Average degree conditions forcing a minor
• On \(K_{s,t}\) minors in \((s+t)\)-chromatic graphs
• Forcing a sparse minor
• Product structure of graph classes with bounded treewidth
• Product structure extension of the Alon-Seymour-Thomas theorem
• The edge-density for \(K_{2,t}\) minors
• Hadwiger’s Conjecture
• Extremal functions for sparse minors
• On \(K_{s,t}\)-minors in graphs with given average degree. II
• Biclique immersions in graphs with independence number 2
• Minors in ‐ Chromatic Graphs, II
• Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs
• The extremal function for Petersen minors
• Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
• Recent progress towards Hadwiger's conjecture
• On the choosability of \(H\)-minor-free graphs
• A lower bound on the average degree forcing a minor
• Cycles of Given Size in a Dense Graph

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)