  We construct a countable planar graph which, for any two vertices $u,v$ and
any integer $k\ge 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.
