Showing math.COShow all
2 papers · 1 filter
math.CO2023
Approximately Packing Dijoins via Nowhere-Zero Flows
Gérard Cornuéjols, Siyue Liu, R. Ravi
In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects each dicut. Woodall conjectured in 1976 that in every digraph…
math.CO2023
Arc connectivity and submodular flows in digraphs
Ahmad Abdi, Gérard Cornuéjols, Giacomo Zambelli
Let be a digraph. For an integer , a -arc-connected flip is an arc subset of such that after reversing the arcs in it the digraph becomes (strongly) -a…