BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Zi-Xia Song (University of Central Florida)
DTSTART:20201231T020000Z
DTEND:20201231T030000Z
DTSTAMP:20260423T021016Z
UID:SCMSComb/26
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SCMSComb/26/
 ">Hadwiger’s Conjecture</a>\nby Zi-Xia Song (University of Central Flori
 da) as part of SCMS Combinatorics Seminar\n\n\nAbstract\nHadwiger’s conj
 ecture from 1943 states that for every integer $t\\ge 1$\, every graph eit
 her can be t-colored or has a subgraph that can be contracted to the compl
 ete graph on t + 1 vertices. This is a far-reaching generalization of the 
 Four-Color Theorem and perhaps the most famous conjecture in graph theory.
  In this talk we will survey the history of Hadwiger’s conjecture and th
 e main ideas of recent results.\n\npw 030303\n
LOCATION:https://researchseminars.org/talk/SCMSComb/26/
END:VEVENT
END:VCALENDAR