BIRS Workshop Lecture Videos
The achromatic number of Knesser graphs and their relationship with Steiner triple systems Araujo-Pardo, Gabriela
In this talk we give the notion of complete colorings in graphs, achromatic number, Knesser graphs and Steiner triple systems . Also, we explain how the Steiner triple systems solve the problem about the existence of complete colorations on Knesser graphs that attain the upper bound of the achromatic number, where the achromatic number of a graph G is the maximum integer value for the number of chromatic classes in a complete and proper coloring of G.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International