Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Tuesday, March 15, 2022 — 3:00 PM EDT
Title: On packing dijoins in digraphs and weighted digraphs
Speaker: Ahmad Abdi Affiliation: LSE Zoom: http://matroidunion.org/?page_id=2477 or email shayla.redlin@uwaterloo.caAbstract:
Let D=(V,A) be a digraph. A dicut is the set of arcs in a cut where all the arcs cross in the same direction, and a dijoin is a set of arcs whose contraction makes D strongly connected. It is known that every dicut and dijoin intersect. Suppose every dicut has size at least k.