The immersion-minimal infinitely edge-connected graph
arXiv:2207.08459 · doi:10.1016/j.jctb.2023.10.007
Abstract
We show that there is a unique immersion-minimal infinitely edge-connected graph: every such graph contains the halved Farey graph, which is itself infinitely edge-connected, as an immersion minor. By contrast, any minimal list of infinitely edge-connected graphs represented in all such graphs as topological minors must be uncountable.
19 pages, 4 figures, to appear in JCTB, tikz code of figures in comments