Graph Coloring and Ramsey’s Theorem

Saturday, April 18, 2009, 3:00 pm

Location: meet up in tearoom, then Ryerson

Lecture by Robby Sare


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.


3 Responses to “Graph Coloring and Ramsey’s Theorem”

  1. Robby Says:

    “Robby” and “theorem” 😉

  2. Alla Says:

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: