TY - JOUR
T1 - On the choice number of complete multipartite graphs with part size four
AU - Kierstead, Henry
AU - Salmon, Andrew
AU - Wang, Ran
N1 - Funding Information:
The first author thanks Institut Mittag-Leffler (Djursholm, Sweden) for its hospitality and creative environment. Research of the first author was supported in part by NSA grant H98230-12-1-0212 .
Publisher Copyright:
© 2016 Elsevier Ltd.
PY - 2016/11/1
Y1 - 2016/11/1
N2 - 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⌉.
AB - 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⌉.
UR - http://www.scopus.com/inward/record.url?scp=84969764677&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84969764677&partnerID=8YFLogxK
U2 - 10.1016/j.ejc.2016.05.001
DO - 10.1016/j.ejc.2016.05.001
M3 - Article
AN - SCOPUS:84969764677
SN - 0195-6698
VL - 58
SP - 1
EP - 16
JO - European Journal of Combinatorics
JF - European Journal of Combinatorics
ER -