Presented by: 
David Wood (Monash University)
Date: 
Mon 5 Aug, 2:00 pm - 2:45 pm
Venue: 
Otto Hirschfeld Building 81-214

In 1943, Hugo Hadwiger introduced the following striking conjecture: every graph that does not contain a complete graph on t+1 vertices as a minor is t-colourable. The t=4 case implies the famous 4-colour theorem for planar maps. Thus Hadwiger's Conjecture suggests a deep generalisation of the 4-colour theorem, and is now widely considered to be one of the most important open problems in graph theory. This talk will describe an approach for attacking Hadwiger's Conjecture based on list colourings.