Excluding Infinite Trees

DOI10.2307/2154396zbMath0780.05015OpenAlexW4254008450MaRDI QIDQ4038489

Robin Thomas, P. D. Seymour

Publication date: 16 May 1993

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

zbMATH Keywords

minorcops-and-robber gameinfinite treesordinals

Mathematics Subject Classification ID

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

Related Items (6)

Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor ⋮ End‐faithful spanning trees in graphs without normal spanning trees ⋮ Excluding infinite minors ⋮ An end-faithful spanning tree counterexample ⋮ An End-Faithful Spanning Tree Counterexample ⋮ Excluding Subdivisions of Infinite Cliques

Cites Work

• Unnamed Item
• Graph minors. I. Excluding a forest
• Quickly excluding a forest
• Über unendliche Wege in Graphen
• Charakterisierung der Graphen ohne unendliche Wege
• An End-Faithful Spanning Tree Counterexample
• Excluding infinite clique minors

This page was built for publication: Excluding Infinite Trees