Disjoint Kr-minors in large graphs with given average degree

Thomas Böhme, Alexandr Kostochka

Research output: Contribution to journalArticlepeer-review


It is proved that there are functions f(r) and N(r,s) such that for every positive integer r, s, each graph G with average degree d(G)=2 E(G) / V(G) ≥f(r), and with at least N(r,s) vertices has a minor isomorphic to Kr,s or to the union of s disjoint copies of Kr.

Original languageEnglish (US)
Pages (from-to)289-292
Number of pages4
JournalEuropean Journal of Combinatorics
Issue number3-4 SPEC. ISS.
StatePublished - Apr 2005

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Disjoint K<sub>r</sub>-minors in large graphs with given average degree'. Together they form a unique fingerprint.

Cite this