You are here

Five-Colour Theorem and Beyond

Date:

Speaker Info:

Bojan Mohar
Professor and Canada Research Chair, Department of Mathematics
Simon Fraser University

Description

In 1994, Carsten Thomassen published a beautiful simple proof confirming that every planar graph is 5-list-colourable. Another beautiful proof on a similar topic was given a few years later by Mike Albertson who proved that every precolouring of a set of vertices in a planar graph that are far apart from each other can be extended to a 5-colouring of the whole graph. After presenting these enlightening contributions, the speaker will discuss possible common generalizations of these results and report on some recent progress.

Sun Mon Tue Wed Thu Fri Sat
 
1
 
2
 
3
 
4
 
5
 
6
 
7
 
8
 
9
 
10
 
11
 
12
 
13
 
14
 
15
 
16
 
17
 
18
 
19
 
20
 
21
 
22
 
23
 
24
 
25
 
26
 
27
 
28
 
29
 
30
 
31
 
 
 
 

WestGrid Training Events

We're planning our next round of sessions! More details will be posted here soon. We invite you to send us topic requests for future sessions, join our mailing list for ongoing updates, and visit our Seminar Archives to review sessions you missed.

Research Seminars

Join our mailing list to stay informed of upcoming research seminars or visit our Seminar Archives to review sessions you missed.