Abstract
Abstract The τ = 2 Conjecture, the Replication Conjecture and the f-Flowing Conjecture, and the classification of binary matroids with the sums of circuits property are foundational to Clutter Theory and have far-reaching consequences in Combinatorial Optimization, Matroid Theory and Graph Theory. We prove that these conjectures and result can equivalently be formulated in terms of cuboids, which form a special class of clutters. Cuboids are used as means to (a) manifest the geometry behind primal integrality and dual integrality of set covering linear programs, and (b) reveal a geometric rift between these two properties, in turn explaining why primal integrality does not imply dual integrality for set covering linear programs. Along the way, we see that the geometry supports the τ = 2 Conjecture. Studying the geometry also leads to over 700 new ideal minimally non-packing clutters over at most 14 elements, a surprising revelation as there was once thought to be only one such clutter.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.