The rainbow covering number of clean tangled clutters
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912580570710016 |
|---|---|
| author | Abdi, Ahmad Cornuéjols, Gérard |
| author_facet | Abdi, Ahmad Cornuéjols, Gérard |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_08505 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The rainbow covering number of clean tangled clutters Abdi, Ahmad Cornuéjols, Gérard Combinatorics Optimization and Control 90C27, 90C57 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. |
| title | The rainbow covering number of clean tangled clutters |
| topic | Combinatorics Optimization and Control 90C27, 90C57 |
| url | https://arxiv.org/abs/2509.08505 |