The combinatorics seminar at KTH

May 9, 2007

Aart Blokhuis (Eindhoven): Do we know all 3-chromatic distance regular graphs?

Abstract:

In the talk we will explain what distance regular graphs are, why they form a beautiful and interesting class of graphs, describe all the (known) examples of the three colorable ones, and try to convince the audience that the list is complete. (this is joint work with Andries Brouwer and Willem Haemers).

Back to the combinatorics seminar