The immersion-minimal infinitely edge-connected graph

DOI10.1016/J.JCTB.2023.10.007MaRDI QIDQ6144409zbMATH OpenOpenAlexFDO

Authors Paul Knappe, Jan Kurkofka

Publication date 29 January 2024

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2207.08459

zbMATH Keywords

Farey graphinfinitely edge-connected graphstrong immersiontypicalunavoidable

Mathematics Subject Classification ID

Connectivity (05C40) Infinite graphs (05C63) Structural characterization of families of graphs (05C75)

Abstract: 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.

Recommendations

• Immersions in highly edge connected graphs
• Orientations of infinite graphs with prescribed edge-connectivity
• On self‐immersions of infinite graphs
• A note on immersion intertwines of infinite graphs
• Immersion in four-edge-connected graphs

Cites work

• A strengthening of Halin's grid theorem
• Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor
• Graph minors XXIII. Nash-Williams' immersion conjecture
• Office hours with a geometric group theorist
• The Farey graph is uniquely determined by its connectivity
• The structure of graphs not admitting a fixed immersion
• Topology of numbers
• Ubiquity and the Farey graph

Cited in

(2)

• A note on clique immersion of strong product graphs
• A metrization theorem for edge-end spaces of infinite graphs

This page was built for publication: The immersion-minimal infinitely edge-connected graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144409)