BEGIN:VCALENDAR
PRODID:-//University of Birmingham//Events//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20231003T124600Z
DTSTART:20231129T190000Z
DTEND:20231129T200000Z
SUMMARY:BPML: A Combinatorial Journey to the Challenger Deep of Mathematics - Dr Jan Kurkofka
UID:www.birmingham.ac.uk/205733
DESCRIPTION:The Graph Minor Theorem, proved over a period of 20 years on 500 pages by Robertson and Seymour, is a landmark in Combinatorics and one of the deepest theorems that Mathematics has to offer. A graph, such as a social network, consists of vertices (people) and edges (friendships) that join pairs of vertices. Graphs come from applications ranging from electrical networks or biological networks to infrastructure networks or big data. We will begin our journey at the surface, no prerequisites required beyond curiosity, and then familiarise ourselves with the maths as we descend into the deep to have a look at what exactly lurks at the bottom.\n
Speaker
 Dr Jan Kurkofka\n
 All the Birmingham Popular Maths Lectures take place in Lecture Theatre A in the Watson Building and run from 19:00-20:00, with doors opening from 18:30.\n
 There is no need to register to attend in person. To register to attend via Zoom, please fill in this form.\n
 You can watch the recorded lecture. You will be asked for a password in order to access the recording; the password is jyY0X*cO\n
LOCATION:Watson Building - Lecture Theatre A (R15 on campus map), Zoom - registration required
STATUS:CONFIRMED
TRANSP:OPAQUE
CLASS:PUBLIC
END:VEVENT
END:VCALENDAR