Graph Coloring and Ramsey’s Theorem

Saturday, April 18, 2009, 3:00 pm

Location: meet up in tearoom, then Ryerson

Lecture by Robby Sare

Abstract:

The theory of graphs is a fruitful and accessible area of abstract
mathematics, with a wide variety of applications, from algorithmic complexity to
logic puzzles in recreational mathematics. We provide the background for, and
discuss the notion of a graph coloring and present and prove some basic results
in the theory of colored graphs. We then outline the applications and
implications of more advanced material, such as Ramsey’s theorem and the
general study of stable sets of vertices.

Advertisements