He–et al. complete multipartite chromatic-choosability conjecture

A complete $k$-partite graph is a graph whose vertices are partitioned into $k$ independent parts, with every pair of vertices in distinct parts adjacent. He et al.'s conjecture. Any complete $k$-partite graph $G$ with $n(G)=2k+1$ is chromatic-choosable. This is presented as a complete-multipartite reformulation of Ohba's conjecture and is therefore resolved by the same result.