- Series
- Graph Theory Seminar
- Time
- Tuesday, November 23, 2021 - 3:45pm for 1 hour (actually 50 minutes)
- Location
- ONLINE
- Speaker
- Jessica McDonald – Auburn University – mcdonald@auburn.edu – http://www.auburn.edu/cosam/faculty/math_stats/mcdonald/
- Organizer
- Anton Bernshteyn
In this talk we’ll discuss strong 4-colourings of graphs and prove two new cases of the Strong Colouring Conjecture. Let H be a graph with maximum degree at most 2, and let G be obtained from H by gluing in vertex-disjoint copies of K_4. We’ll show that if H contains at most one odd cycle of length exceeding 3, or if H contains at most 3 triangles, then G is 4-colourable. This is joint work with Greg Puleo.