The Farey graph is uniquely determined by its connectivity
arXiv:2006.12472
Abstract
We show that, up to minor-equivalence, the Farey graph is the unique minor-minimal graph that is infinitely edge-connected but such that every two vertices can be finitely separated.
arXiv comment9 pages, 1 figure. arXiv admin note: text overlap with arXiv:2004.06710