Approximately Packing Dijoins Via Nowhere-Zero Flows by Dr. Ravi
Bharti 501 IIT Campus, Hauz Khas, New DelhiVenue: Bharti501 Abstract: 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, the minimum size of a dicut equals to the maximum number of disjoint dijoins. By building connections… Read More »Approximately Packing Dijoins Via Nowhere-Zero Flows by Dr. Ravi
