Speaker:  Ben Braun, U Kentucky

Title: Graph constructions and chromatic numbers

Abstract: We will survey various graph constructions related to proper k-colorability. Possible topics for discussion include constructions of k-chromatic graphs due to Hajos, Ore, and Urquhart, constructions of graphs with high girth and high chromatic number due to Alon, Kostochka, Reiniger, West, and Zhu, and constructions of k-critical graphs with minimal possible number of edges due to Kostochka and Yancey.