12 citations · 34 across the 21 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
Ubiquity and the Farey graph
Jan Kurkofka
We construct a countable planar graph which, for any two vertices and any integer , contains edge-disjoint order-compatible -- paths but not infinitely many…
math.CO2019
On the tangle compactification of infinite graphs
Jan Kurkofka
In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same…