Every infinitely edge-connected graph contains the Farey graph or T_0\! t as a minor
Abstract
We show that every infinitely edge-connected graph contains the Farey graph or T_0\! t as a minor. These two graphs are unique with this property up to minor-equivalence.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.