Graphs with Large Girth and Large Chromatic Number

Authors

Liam Rafferty, Department of Mathematical Sciences, University of Montana

Document Type

Presentation Abstract

Presentation Date

3-14-2011

Abstract

An historic graph theoretic result is Paul Erdős' 1959 theorem that there exist graphs that have both arbitrarily large girth and arbitrarily large chromatic number. This was interesting not only because it was a surprising achievement, but also because of the proof's elegant use of probabilistic arguments. In this talk, we will explore the history of this result and its descendants and briefly describe how my own research fits into this body of work.

Additional Details

Monday, 14 March 2011
3:10 p.m. in Math 103
4:00 p.m. Refreshments in Math Lounge 109

Recommended Citation

Rafferty, Liam, "Graphs with Large Girth and Large Chromatic Number" (2011). Colloquia of the Department of Mathematical Sciences. 366.
https://scholarworks.umt.edu/mathcolloquia/366