当前位置:
X-MOL 学术
›
J. Comb. Theory B
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
The Farey graph is uniquely determined by its connectivity
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2021-06-29 , DOI: 10.1016/j.jctb.2021.06.006 Jan Kurkofka
中文翻译:
Farey 图由其连通性唯一确定
更新日期:2021-06-29
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2021-06-29 , DOI: 10.1016/j.jctb.2021.06.006 Jan Kurkofka
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 图是唯一的次要极小图,它是无限边连接的,但每两个顶点都可以有限地分离。