Hall numbers of some complete $k-$partite graphs
Combinatorics
2026-02-03 v1
Abstract
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 , , are equal to their choice numbers.
Keywords
Cite
@article{arxiv.2602.00442,
title = {Hall numbers of some complete $k-$partite graphs},
author = {Julian A. Allagan},
journal= {arXiv preprint arXiv:2602.00442},
year = {2026}
}
Comments
11 pages, 1 figure