Forcing unbalanced complete bipartite minors (Q703605): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2004.02.002 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1979717362 / rank | |||
Normal rank |
Revision as of 03:09, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Forcing unbalanced complete bipartite minors |
scientific article |
Statements
Forcing unbalanced complete bipartite minors (English)
0 references
11 January 2005
0 references
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.
0 references
average degree
0 references
complete bipartite minor
0 references