Approximating infinite graphs by normal trees

19 Feb 2020 Jan Kurkofka Ruben Melcher Max Pitz

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both combinatorial and topological nature... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS
  • GENERAL TOPOLOGY
  • 05C63, 54D20