K₆ minors in large 6-connected graphs

DOI10.1016/J.JCTB.2017.09.007MaRDI QIDQ684126zbMATH OpenOpenAlexFDO

Authors Serguei Norine, Robin Thomas, Paul Wollan, Ken-ichi Kawarabayashi

Publication date 9 February 2018

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.2192

zbMATH Keywords

\(K_6\) minorgraph minorJorgensen's conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph minors (05C83)

Abstract: Jorgensen conjectured that every 6-connected graph with no K_6 minor has a vertex whose deletion makes the graph planar. We prove the conjecture for all sufficiently large graphs.

Recommendations

• \(K_{6}\) minors in 6-connected graphs of bounded tree-width
• Extremal results regarding \(K_6\)-minors in graphs of girth at least 5
• Simple graphs of order 12 and minimum degree 6 contain \(K_6\) minors
• Minors in large almost-5-connected non-planar graphs
• K₆-minors in triangulations and complete quadrangulations

Cites work

• Contractions to k₈
• Extending partial 3-colourings in a planar graph
• Graph minors. IX: Disjoint crossed paths
• Graph minors. V. Excluding a planar graph
• Graph minors. XIII: The disjoint paths problem
• Graph minors. XXI. graphs with unique linkages
• Graph searching and a min-max theorem for tree-width
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Highly connected sets and the excluded grid theorem
• scientific article; zbMATH DE number 1057879 (Why is no real title available?)
• scientific article; zbMATH DE number 3102312 (Why is no real title available?)
• Non-planar extensions of subdivisions of planar graphs
• Quickly excluding a planar graph
• Über trennende Eckenmengen in homomorphiekritischen Graphen

Cited in

(17)

• The extremal function for Petersen minors
• K₆-minors in projective planar graphs
• On the excluded minor structure theorem for graphs of large tree-width
• Simple graphs of order 12 and minimum degree 6 contain \(K_6\) minors
• Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
• \(K_{6}\) minors in 6-connected graphs of bounded tree-width
• Minors in large almost-5-connected non-planar graphs
• On the structure of \(C_3\)-critical minimal 6-connected graphs
• The Erdős-Pósa property for clique minors in highly connected graphs
• Linkless and flat embeddings in 3-space
• Extremal results regarding \(K_6\)-minors in graphs of girth at least 5
• \(K_{6}\)-minors in triangulations on the nonorientable surface of genus 3
• Packing topological minors half‐integrally
• Optimal 1-planar multigraphs
• K₇-minors in optimal 1-embedded graphs on the projective plane
• On the size of two minimal linkages
• Contractibility and the Hadwiger conjecture

This page was built for publication: \(K_{6}\) minors in large 6-connected graphs

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