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.

### Like this:

Like Loading...

*Related*

This entry was posted on April 14, 2009 at 2:11 am and is filed under Upcoming Lectures. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

April 19, 2009 at 11:56 am |

“Robby” and “theorem” 😉

April 21, 2009 at 2:27 am |

…I’m a tree. Fixed. /Sorry/. Fail :p

April 21, 2009 at 3:17 am |