BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20261017T180022Z
UID:Seminar-dept-1517@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20261027T130000
DTEND:20261027T140000
SUMMARY:School Seminar Series
DESCRIPTION:Tung Nguyen: On the solution to the Erdős–Hajnal problem on high-girth high-chromatic subgraphs\n\nA well-known problem of Erdős and Hajnal from the 1960s asks whether every graph with huge chromatic number contains a subgraph with large girth and large chromatic number. Very recently, Kohlmeyer and Kruer, by means of AI tools, provided a strong negative solution to this problem. The talk aims to explain the construction method and relate it to relevant literature. Joint work with Bartosz Walczak.\n\n\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1517
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR