Thursday, June 30, 2016 3:30 pm
-
5:00 pm
EDT (GMT -04:00)
Title: 3-choosable planar graphs with small cycles far apart
Speaker: | Matthew Sullivan |
Affiliation: | University of Waterloo |
Room: | MC 5417 |
Abstract:
We know that not all planar graphs are 3-choosable (as seen by $K_4$), but it is still interesting to find out what types of planar graphs are. I will go into detail about some results on the 3-choosability of planar graphs with 3-cycles far apart using discharging. As well, I will talk about an inductive proof for a more general theorem of Thomassens planar graphs with girth 5 are 3-choosable.