The immersion-minimal infinitely edge-connected graph

DOI10.1016/j.jctb.2023.10.007arXiv2207.08459OpenAlexW4388507026MaRDI QIDQ6144409

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 graphtypicalinfinitely edge-connected graphstrong immersionunavoidable

Mathematics Subject Classification ID

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

Cites Work

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

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