Linear connectivity forces large complete bipartite minors (Q1026000)

From MaRDI portal
Revision as of 23:12, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Linear connectivity forces large complete bipartite minors
scientific article

    Statements

    Linear connectivity forces large complete bipartite minors (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 June 2009
    0 references
    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