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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have