Excluding Infinite Trees

DOI10.2307/2154396MaRDI QIDQ4038489zbMATH OpenOpenAlexFDO

Authors Robin Thomas, Paul Seymour

Publication date 16 May 1993

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

zbMATH Keywords

cops-and-robber gameinfinite treesminorordinals

Mathematics Subject Classification ID

Consistency and independence results (03E35) Trees (05C05) Structural characterization of families of graphs (05C75) Games involving graphs (91A43)

Recommendations

• Excluding infinite minors
• Normal Spanning Trees, Aronszajn Trees and Excluded Minors
• Excluding infinite clique minors
• Excluding a countable clique
• An accessibility theorem for infinite graph minors

Cites work

• An End-Faithful Spanning Tree Counterexample
• Charakterisierung der Graphen ohne unendliche Wege
• Excluding infinite clique minors
• Graph minors. I. Excluding a forest
• scientific article; zbMATH DE number 3697170 (Why is no real title available?)
• Quickly excluding a forest
• Über unendliche Wege in Graphen

Cited in

(10)

• Excluding infinite minors
• An end-faithful spanning tree counterexample
• Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor
• An End-Faithful Spanning Tree Counterexample
• Excluding Subdivisions of Infinite Cliques
• scientific article; zbMATH DE number 1941338 (Why is no real title available?)
• A new obstruction for normal spanning trees
• End‐faithful spanning trees in graphs without normal spanning trees
• Counterexamples regarding linked and lean tree-decompositions of infinite graphs
• Minimal universal and dense minor closed classes

This page was built for publication: Excluding Infinite Trees

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