### Chromatic numbers of abelian Cayley graphs (Michael Krebs, Cal State LA)

Roberts North 102, CMCA classic problem in graph theory is to find the chromatic number of a given graph: that is, to find the smallest number of colors needed to assign every vertex a color such that whenever two vertices are adjacent, they receive different colors. This problem has been studied for many families of graphs, including cube-like […]