Forcing unbalanced complete bipartite minors (Q703605)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Forcing unbalanced complete bipartite minors |
scientific article; zbMATH DE number 2126331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Forcing unbalanced complete bipartite minors |
scientific article; zbMATH DE number 2126331 |
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
0.87615985
0 references
0.8664291
0 references
0.8549229
0 references
0 references
0 references
0.84721047
0 references
0.8433428
0 references
0.8411756
0 references
0.8382946
0 references
