Hall numbers of some complete $k-$partite graphs

arXiv (Cornell University) 2026 Preprint Open access

Read full text
Authors: Julian A. Allagan
Cited by: 0

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 $K(m,2,\ldots,2)$, $m\ge 2$, are equal to their choice numbers.

Fields of Study & Subjects

Advanced Graph Theory Research Limits and Structures in Graph Theory Graph Labeling and Dimension Problems

Publication details

Journal / source
arXiv (Cornell University)
Publication date
31 January 2026
Document type
Preprint