Forcing unbalanced complete bipartite minors (Q703605)

The authors prove that for every \(0<\varepsilon<10^{-16}\) there exists a number \(t_0=t_0(\varepsilon)\) such that for alle integers \(t\geq t_0\) and \(s\leq \varepsilon^6 t/ \log t\) every graph of average degree at least \((1+\varepsilon)t\) contains a \(K_{s,t}\) minor which implies a recent conjecture of Myers.