{"ID":2872571,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2509.08505","arxiv_id":"2509.08505","title":"The rainbow covering number of clean tangled clutters","abstract":"In this brief note, we prove a min-min equality for a clean tangled clutter, that the rainbow covering number is equal to the connectivity of its setcore.","short_abstract":"In this brief note, we prove a min-min equality for a clean tangled clutter, that the rainbow covering number is equal to the connectivity of its setcore.","url_abs":"https://arxiv.org/abs/2509.08505","url_pdf":"https://arxiv.org/pdf/2509.08505v1","authors":"[\"Ahmad Abdi\",\"Gérard Cornuéjols\"]","published":"2025-09-10T11:25:22Z","proceeding":"math.CO","tasks":"[\"math.CO\",\"math.OC\"]","methods":"[]","has_code":false}