Problem 16.12: Coloring Number


Problem 16.12 has been completely solved in the affirmative by Péter Komjáth, Budapest. The solution is published in the paper

P. Komjáth, Two Remarks on the Coloring Number, J. Combin. Theory Ser. B 70 (1997), 301-305.

I do not know if the case of "induced subgraphs" has been solved, but it seems not to be the case (judging from Komjáth's paper).

August 18, 1997. B. Toft.


Back to Overview menu
Back to Graph Coloring Problems homepage

Last modified August 18, 1997 Bjarne Toft