From e-mail: ``I would like to talk about equitable coloring. Kostochka and I have
very recently found a short proof (7/3 pages) of the famous theorem
of Hajnal and Szemeredi that every graph with maximum degree at most
r has an equitable (r+1)-coloring. We also have other results in
this area. (...) I could (...) do the short proof. This (...)
option would require energy, flexibility and cooperation from
the audience as it would probably run over the normal 50 minutes."