Directed cut transversal packing for source-sink connected graphs (Q1101126)

A proof is given for the side coboundaries of a graph concerning the conjecture that in every directed graph, a maximum packing of directed cut transversals is equal in cardinality to a minimum directed cut. It first reduces the problem to a packing theorem for bi-transversals, and then constructs a packing of bi-transversals of the required size, one edge at a time, by maintaining a Hall-like feasibility condition as each edge is added.