Some results on a list coloring conjecture of Reed
Xu Yang, Zhu Xiao · 2006
We construct graphs with of available colors for each vertex,such that the size of every list is at least the maximum intersextion of every V_c with the neighborhood of a Vertices,but there exists no proper coloring from the lists.This disproves a conjecture of Reed.