Elsevier

Discrete Mathematics

Volume 312, Issue 24, 28 December 2012, Pages 3517-3522
Discrete Mathematics

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

https://doi.org/10.1016/j.disc.2012.08.004Get rights and content
Under an Elsevier user license
open archive

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 t/log2t1000s, then every graph G with average degree at least t+8slog2s has a Ks,t minor. This refines a corresponding result by Kühn and Osthus.

Keywords

Bipartite minors
Dense graphs

Cited by (0)