Now showing items 1-2 of 2
The Cycling Property for the Clutter of Odd st-Walks
(University of Waterloo, 2014-01-23)
A binary clutter is cycling if its packing and covering linear program have integral optimal solutions for all Eulerian edge capacities. We prove that the clutter of odd st- walks of a signed graph is cycling if and only ...
(University of Waterloo, 2018-04-24)
Let E be a finite set of elements, and let C be a family of subsets of E called members. We say that C is a clutter over ground set E if no member is contained in another. The clutter C is ideal if every extreme point of ...