BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The algorithmic strength of planar graph colouring theorems - Selw
 yn Ng (Nanyang Technological University)
DTSTART:20220606T090000Z
DTEND:20220606T100000Z
UID:TALK174755@talks.cam.ac.uk
DESCRIPTION:We discuss the $k$-colour theorem for planar graphs\, in the c
 ontext of reverse mathematics as well as the uniform reducibility between 
 the different parameterized versions of the $k$-colour theorem. We show th
 at there is a proper hierarchy of principles corresponding to different pa
 rameters and restrictions on the graph.
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR