We find a family of graphs each of which is not Hall -chromatic for all , and use this to prove that the same holds for the Kneser graphs when and is sufficiently large (depending on ). We also make some progress on the problem of characterizing the graphs that are Hall -chromatic for all .