A proof of the bounded graph conjecture

DOI10.1007/BF02100602zbMath0793.05121WikidataQ122955647 ScholiaQ122955647MaRDI QIDQ1207424

Imre Leader, Reinhard Diestel

Publication date: 1 April 1993

Published in: Inventiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/143991

zbMATH Keywords

characterizationminorsraycountable graphsbounded graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (11)

Domination games on infinite graphs ⋮ A simple existence criterion for normal spanning trees ⋮ Topological paths, cycles and spanning trees in infinite graphs ⋮ End spaces and spanning trees ⋮ The Growth of Infinite Graphs: Boundedness and Finite Spreading ⋮ The fundamental group of a locally finite graph with ends ⋮ A unified existence theorem for normal spanning trees ⋮ The homology of a locally finite graph with ends ⋮ The end structure of a graph: Recent results and open problems ⋮ Normal Tree Orders for Infinite Graphs ⋮ Cardinal characteristics on graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A short proof of the restricted Ramsey theorem for finite set systems
• Bounded graphs
• On spanning trees and \(k\)-connectedness in infinite graphs
• Simplicial Decompositions of Infinite Graphs
• Universal graphs and universal functions
• Wurzelbäume und unendliche Wege in Graphen

This page was built for publication: A proof of the bounded graph conjecture