Ideal Clutters
Loading...
Date
2018-04-24
Authors
Abdi, Ahmad
Journal Title
Journal ISSN
Volume Title
Publisher
University of Waterloo
Abstract
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 the polyhedron { x>=0 : x(C) >= 1 for every member C } is integral.
Ideal clutters are central objects in Combinatorial Optimization, and they have deep connections to several other areas. To integer programmers, they are the underlying structure of set covering integer programs that are easily solvable. To graph theorists, they are manifest in the famous theorems of Edmonds and Johnson on T-joins, of Lucchesi and Younger on dijoins, and of Guenin on the characterization of weakly bipartite graphs; not to mention they are also the set covering analogue of perfect graphs. To matroid theorists, they are abstractions of Seymour’s sums of circuits property as well as his f-flowing property. And finally, to combinatorial optimizers, ideal clutters host many minimax theorems and are extensions of totally unimodular and balanced matrices.
This thesis embarks on a mission to develop the theory of general ideal clutters.
In the first half of the thesis, we introduce and/or study tools for finding deltas, extended odd holes and their blockers as minors; identically self-blocking clutters; exclusive, coexclusive and opposite pairs; ideal minimally non-packing clutters and the τ = 2 Conjecture; cuboids; cube-idealness; strict polarity; resistance; the sums of circuits property; and minimally non-ideal binary clutters and the f-Flowing Conjecture.
While the first half of the thesis includes many broad and high-level contributions that are accessible to a non-expert reader, the second half contains three deep and technical contributions, namely, a character- ization of an infinite family of ideal minimally non-packing clutters, a structure theorem for ±1-resistant sets, and a characterization of the minimally non-ideal binary clutters with a member of cardinality three.
In addition to developing the theory of ideal clutters, a main goal of the thesis is to trigger further research on ideal clutters. We hope to have achieved this by introducing a handful of new and exciting conjectures on ideal clutters.
Description
Keywords
clutters, ideal matrices, the packing property, integral polyhedra, set covering polyhedron, degenerate projective planes, cuboids, binary clutters, strict polarity, cube-ideal sets, identically self-blocking clutters, resistant sets, minimally non-ideal clutters