Forcing a Kr minor by high external connectivity

DOI10.1002/JGT.10026MaRDI QIDQ4537560zbMATH OpenOpenAlexFDO

Authors Daniela Kühn

Publication date 1 July 2002

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10026

zbMATH Keywords

connectivitylarge minors

Mathematics Subject Classification ID

Connectivity (05C40) Graph minors (05C83)

Recommendations

• \(K_{a,k}\) minors in graphs of bounded tree-width
• Linear connectivity forces large complete bipartite minors
• Rooted minor problems in highly connected graphs
• Linear connectivity forces large complete bipartite minors: an alternative approach
• Average degree conditions forcing a minor

Cites work

• Excluding a countable clique
• Graph minors. V. Excluding a planar graph
• Graph minors. XVI: Excluding a non-planar graph
• Highly connected sets and the excluded grid theorem

Cited in

(1)

• Linear connectivity forces large complete bipartite minors: an alternative approach

This page was built for publication: Forcing a K_r minor by high external connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537560)