论文标题
Farey图是由其连接性唯一决定的
The Farey graph is uniquely determined by its connectivity
论文作者
论文摘要
我们表明，最终，Farey图是独特的次要最小图，它是无限边缘连接的，但每两个顶点都可以有限地分开。
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.
