Year: 2026
Type: article
Abstract: Fix m≥3. The choice number ch(Km,n) of the complete bipartite graph Km,n has two sharp thresholds as n grows. We give complete proofs of the Hoffman–Johnson values at levels m+1 and m, and we pin down the extremal list assignments at the lower threshold n0=(m−1)m−1−(m−2)m−1. Specifically, ch(Km,n)=m+1,n≥mm,m,n0≤n
Source: Axioms
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,896
OpenAlex ID: W7141420885