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.

中文翻译：

---

浸没最小无限边连通图

我们证明存在一个独特的浸入最小无限边连接图：每个这样的图都包含减半的 Farey 图，它本身是无限边连接的，作为浸入次要图。

相比之下，在所有此类图中表示为拓扑次要图的无限边连接图的任何最小列表必定是不可数的。