Mathematics > Combinatorics
[Submitted on 18 Jul 2022 (v1), last revised 23 Oct 2023 (this version, v2)]
Title:The immersion-minimal infinitely edge-connected graph
View PDFAbstract: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.
Submission history
From: Paul Knappe [view email][v1] Mon, 18 Jul 2022 09:27:56 UTC (151 KB)
[v2] Mon, 23 Oct 2023 08:27:42 UTC (170 KB)
References & Citations
Bookmark
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.