Claims

../

1980_01_01_erdos_rubin_taylor: The paper that introduces choosability states that the least number of vertices of a bipartite graph that is not 2-choosable is 6, together with general bounds on n(k); a conference proceedings with no record of refereeing.

1996_01_01_hanson_macgillivray_toft: Every complete bipartite graph that is not 3-choosable has at least 14 vertices, and the lines of the Fano plane as lists on K_{7,7} show that 14 is attained, so n(3) = 14; refereed.

---