Ubiquity and the Farey graph
Abstract
We construct a countable planar graph which, for any two vertices u,v and any integer k 1, contains k edge-disjoint order-compatible u--v paths but not infinitely many. This graph has applications in Ramsey theory, in the study of connectivity and in the characterisation of the Farey graph.
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.