Tuesday, November 3, 2015 10:30 am
-
10:30 am
EST (GMT -05:00)
Title: Brooks' theorem for matroids
| Speaker: | Peter Nelson |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract: Let G be a graph with maximum degree $\Delta$. Brooks' theorem states that G has chromatic number at most $\Delta$+1, and that if equality holds, then G is a clique or odd cycle. I will discuss a natural matroidal analogue of this result, proved very recently by James Oxley.