Let ch(G) denote the choice number of a graph G, and let Ks*k be the complete k-partite graph with s vertices in each part. Erdos, Rubin, and Taylor showed that ch(K2*k)=k, and suggested the problem of determining the choice number of Ks*k. The first author established ch(K3*k)=⌈4k-13⌉. Here we prove ch(K4*k)=⌈3k-12⌉.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics