Every clean clutter with covering number at least two has a dyadic fractional packing of value two. Proof of Theorem 1.5, assuming Theorem 1.4. Let C be a clean clutter with covering number at least two, and let C0 be a deletion minor that is minimal subject to having covering number at least two.
In this paper, we introduce and study basic geometric notions defined on clutters, including entanglement between clutters, a notion that is intimately linked ...
Feb 5, 2021 · Theorem 1.5. Every clean clutter with covering number at least two has a dyadic fractional packing of value two. Proof of Theorem 1.5, assuming ...
Dec 21, 2021 · Abstract. A vector is dyadic if each of its entries is a dyadic rational number, i.e., an integer multiple of 1 2k for some nonnegative ...
In particular, every clean tangled clutter has a fractional packing of value two. Let be a clean tangled clutter. Then the core of is the clutter.
Let C be a clean tangled clutter. It was recently proved that C has a fractional packing of value two. Collecting the supports of all such fractional packings, ...
This result is best possible, for there exist clean clutters with a covering number of three and no dyadic fractional packing of value three. Examples of clean ...
Dec 20, 2021 · Let C be a clean tangled clutter. It was recently proved that C has a fractional packing of value two. Collecting the supports of all such ...
Clean clutters and dyadic fractional packings. A Abdi, G Cornuéjols, B Guenin, L Tunçel. SIAM Journal on Discrete Mathematics 36 (2), 1012-1037, 2022. 8, 2022.
Let C be a clean tangled clutter. It was recently proved that C has a fractional packing of value two. Collecting the supports of all such fractional packings, ...