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.

中文翻译：

---

Farey 图由其连通性唯一确定

我们证明，直到次要等价，Farey 图是唯一的次要极小图，它是无限边连接的，但每两个顶点都可以有限地分离。