Minimum covering by triples, quadruples and quintuples with minimum excess
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917353212608512 |
|---|---|
| author | Kovář, Petr Zhang, Yifan |
| author_facet | Kovář, Petr Zhang, Yifan |
| contents | This article explores a new type of optimal covering of a complete graph by small cliques of different sizes, namely the minimum covering with minimum excess. In particular, the minimum size of a covering by triples and quadruples with minimum excess is determined. Moreover, some generalisation onto minimum coverings by triples, quadruples and quintuples with minimum excess is presented. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_18803 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Minimum covering by triples, quadruples and quintuples with minimum excess Kovář, Petr Zhang, Yifan Combinatorics 05B40, 05C70 This article explores a new type of optimal covering of a complete graph by small cliques of different sizes, namely the minimum covering with minimum excess. In particular, the minimum size of a covering by triples and quadruples with minimum excess is determined. Moreover, some generalisation onto minimum coverings by triples, quadruples and quintuples with minimum excess is presented. |
| title | Minimum covering by triples, quadruples and quintuples with minimum excess |
| topic | Combinatorics 05B40, 05C70 |
| url | https://arxiv.org/abs/2603.18803 |