Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.00442 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911412429783040 |
|---|---|
| author | Allagan, Julian A. |
| author_facet | Allagan, Julian A. |
| contents | The Hall number is a graph parameter closely related to the choice number. Here it is shown that the Hall numbers of the complete multipartite graphs $K(m,2,\ldots,2)$, $m\ge 2$, are equal to their choice numbers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_00442 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Hall numbers of some complete $k-$partite graphs Allagan, Julian A. Combinatorics 05C15, 05C35 The Hall number is a graph parameter closely related to the choice number. Here it is shown that the Hall numbers of the complete multipartite graphs $K(m,2,\ldots,2)$, $m\ge 2$, are equal to their choice numbers. |
| title | Hall numbers of some complete $k-$partite graphs |
| topic | Combinatorics 05C15, 05C35 |
| url | https://arxiv.org/abs/2602.00442 |