1 citations · 2 across the 5 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023
On the ubiquity of oriented double rays
Florian Gut, Thilo Krill, Florian Reich
A digraph is called ubiquitous if every digraph that contains arbitrarily many vertex-disjoint copies of also contains infinitely many vertex-disjoint copies of . We stu…
math.CO2023
Menger's Theorem in bidirected graphs
Nathan Bowler, Ebrahim Ghorbani, Florian Gut +2
Bidirected graphs are a generalisation of directed graphs that arises in the study of undirected graphs with perfect matchings. Menger's famous theorem - the minimum size of a set…
math.CO2023★ 1 cited
Decomposition of (infinite) digraphs along directed 1-separations
Nathan Bowler, Florian Gut, Meike Hatzel +3
We introduce torsoids, a canonical structure in matching covered graphs, corresponding to the bricks and braces of the graph. This allows a more fine-grained understanding of the s…