Excluding Subdivisions of Infinite Cliques

DOI10.2307/2154029zbMath0774.05084OpenAlexW4256447407MaRDI QIDQ4018433

Neil Robertson, Robin Thomas, P. D. Seymour

Publication date: 16 January 1993

Full work available at URL: https://doi.org/10.2307/2154029

zbMATH Keywords

characterizationsubdivisionwidthcomplete graphsubgraphinfinite cliquestree- decomposition

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (10)

Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor ⋮ Some recent progress and applications in graph minor theory ⋮ Ends and tangles ⋮ Hadwiger's conjecture for uncountable graphs ⋮ A unified existence theorem for normal spanning trees ⋮ Unfriendly partitions for graphs not containing a subdivison of an infinite cycle ⋮ An end-faithful spanning tree counterexample ⋮ An End-Faithful Spanning Tree Counterexample ⋮ Hadwiger’s Conjecture ⋮ Excluding a countable clique

Cites Work

• Unnamed Item
• Graph minors. III. Planar tree-width
• Graph minors. I. Excluding a forest
• Quickly excluding a forest
• Excluding infinite minors
• Clique-sums, tree-decompositions and compactness
• Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
• An End-Faithful Spanning Tree Counterexample
• Excluding Infinite Trees

This page was built for publication: Excluding Subdivisions of Infinite Cliques