R. Diestel conjectured that an infinite graph
contains a topologically end-faithful
forest if end only if its end space is
metrizable. We prove this conjecture for uniform
end spaces.
Keywords :
infinite graph, topological end space, uniformly end-faithful, topologicatty end-faithful