### Homomorphisms and colouring for graphs and binary matroids

- Series
- Graph Theory Seminar
- Time
- Tuesday, June 8, 2021 - 15:00 for 1 hour (actually 50 minutes)
- Location
- https://us02web.zoom.us/j/87593953555?pwd=UWl4eTVsanpEUHJDWFo3SWpNNWtxdz09
- Speaker
- Jim Geelen – University of Waterloo – Jim.Geelen@uwaterloo.ca

**Please Note:** Description:This talk is part of the Round the World Relay in Combinatorics

The talk starts with Rödl's Theorem that graphs with huge chromatic number contain triangle-free subgraphs with large chromatic number. We will look at various related results and conjectures, with a notable matroid bias; the new results are joint work with Peter Nelson and Raphael Steiner.