On K s,t-minors in graphs with given average degree, II

A. V. Kostochka, N. Prince

Research output: Contribution to journalArticlepeer-review

Abstract

Let Ks,t* denote the graph obtained from Ks, t by adding all edges between the s vertices of degree t in it. We show how to adapt the argument of our previous paper [A.V. Kostochka, N. Prince, On Ks, t-minors in graphs with given average degree, Discrete Math. 308 (2008) 4435-4445] to prove that if tlog 2t<1000s, then every graph G with average degree at least t+8slog 2s has a Ks,t* minor. This refines a corresponding result by Kühn and Osthus.

Original languageEnglish (US)
Pages (from-to)3517-3522
Number of pages6
JournalDiscrete Mathematics
Volume312
Issue number24
DOIs
StatePublished - Dec 28 2012

Keywords

  • Bipartite minors
  • Dense graphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'On K <sub>s,t</sub>-minors in graphs with given average degree, II'. Together they form a unique fingerprint.

Cite this