• Title of article

    End spaces and spanning trees

  • Author/Authors

    Diestel، نويسنده , , Reinhard، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2006
  • Pages
    9
  • From page
    846
  • To page
    854
  • Abstract
    We determine when the topological spaces | G | naturally associated with a graph G and its ends are metrizable or compact. most natural topology, | G | is metrizable if and only if G has a normal spanning tree. We give two proofs, one of them based on Stoneʹs theorem that metric spaces are paracompact. w that | G | is compact in the most natural topology if and only if no finite vertex separator of G leaves infinitely many components. When G is countable and connected, this is equivalent to the existence of a locally finite spanning tree. The proof uses ultrafilters and a lemma relating ends to directions.
  • Keywords
    ends of graphs , Metrizability , Normal spanning trees , Freudenthal compactification , trees
  • Journal title
    Journal of Combinatorial Theory Series B
  • Serial Year
    2006
  • Journal title
    Journal of Combinatorial Theory Series B
  • Record number

    1527740