Title: Moore GraphsSpeaker: Chris Godsil Affiliation: University of Waterloo Room: MC 5417
Moore graphs were introduced by Hoffman and Singleton in a fundamental paper. They can be defined as graphs with diameter $d$ and girth $2d+1$.
Title: A generalization of balanced tableaux and matching problems with unique solutionsSpeaker: Brian Chan Affiliation: University of British Columbia Room: MC 5417
In this talk, we consider families of finite sets that we call shellable and that have been characterized by Chang and Hirst and Hughes as being the families of sets that admit unique solutions to Hall's matching problem.
Title: List Colouring and Ohba's ConjectureSpeaker: Matt Kroeker Affiliation: University of Waterloo Room: MC 5479
The question of when the list-chromatic number of a graph G, denoted chi_l(G), equals its chromatic number is fundamental to the theory of list colouring.