6 citations · 17 across the 16 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023
Path Odd-Covers of Graphs
Steffen Borgwardt, Calum Buchanan, Eric Culver +3
We introduce and study "path odd-covers", a weakening of Gallai's path decomposition problem and a strengthening of the linear arboricity problem. The "path odd-cover number" $p_2(…
math.CO2023★ 1 cited
On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture
Alexander E. Black, Steffen Borgwardt, Matthias Brugger
Circuit diameters of polyhedra are a fundamental tool for studying the complexity of circuit augmentation schemes for linear programming and for finding lower bounds on combinatori…