Linear connectivity forces large complete bipartite minors (Q1026000)
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: Linear connectivity forces large complete bipartite minors |
scientific article; zbMATH DE number 5569112
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear connectivity forces large complete bipartite minors |
scientific article; zbMATH DE number 5569112 |
Statements
Linear connectivity forces large complete bipartite minors (English)
0 references
23 June 2009
0 references
graph minor
0 references
tree-width
0 references
tree-decomposition
0 references
path-decomposition
0 references
complete graph minor
0 references
complete bipartite minor
0 references
unavoidable minor
0 references
connectivity
0 references
\(k\)-linked
0 references
Hadwiger conjecture
0 references
grid minor
0 references
vortex structure
0 references
near embedding
0 references
graphs on surfaces
0 references
Euler's formula
0 references
Erdős-Pósa property
0 references
0 references
0.9795847
0 references
0.9435118
0 references
0 references
0.8710669
0 references
0.8703816
0 references
0.85745823
0 references
0.85576713
0 references
