Hall numbers of some complete k-partite graphs
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,…,2), m 2, are equal to their choice numbers.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.