The rainbow covering number of clean tangled clutters
Combinatorics
2025-09-11 v1 Optimization and Control
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.
Keywords
Cite
@article{arxiv.2509.08505,
title = {The rainbow covering number of clean tangled clutters},
author = {Ahmad Abdi and Gérard Cornuéjols},
journal= {arXiv preprint arXiv:2509.08505},
year = {2025}
}