论文标题

浸入式最小无限边缘连接图

The immersion-minimal infinitely edge-connected graph

论文作者

Knappe, Paul, Kurkofka, Jan

论文摘要

我们表明,有一个独特的浸入式浸入式无限边缘连接的图:每个这样的图都包含一半的farey图,该图本身是无限边缘连接的,作为浸入式小调。 相比之下,所有在拓扑未成年人等图表中表示的无限边缘连接图的最小列表都必须不可数。

We show that there is a unique immersion-minimal infinitely edge-connected graph: every such graph contains the halved Farey graph, which is itself infinitely edge-connected, as an immersion minor. By contrast, any minimal list of infinitely edge-connected graphs represented in all such graphs as topological minors must be uncountable.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源