BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv7.32.0//EN
X-ORIGINAL-URL:https://www.cmm.uchile.cl/
X-WR-CALNAME:CMM
X-WR-CALDESC:Centro de Modelamiento Matemático
X-WR-TIMEZONE:America/Santiago
BEGIN:VTIMEZONE
TZID:America/Santiago
X-LIC-LOCATION:America/Santiago
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0400
TZNAME:-04
DTSTART:20260616T065844
END:STANDARD
END:VTIMEZONE
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
UID:MEC-e529a9c31550811d7c83de623389e938@cmm.uchile.cl
DTSTART;TZID=America/Santiago:20260610T100000
DTEND;TZID=America/Santiago:20260610T120000
DTSTAMP:20260609T095328Z
CREATED:20260609
LAST-MODIFIED:20260609
PRIORITY:5
SEQUENCE:1
TRANSP:OPAQUE
SUMMARY:Graph Theory Seminar: Hamilton cycles in sparse graphs: between randomness and symmetry.
DESCRIPTION:Abstract: When does a graph G contain a Hamilton cycle? This is one of the central questions of graph theory, which is one of Karp´s original  21 NP-complete problems. In this talk, I’ll revise conditions on sparse graphs that ensure the existence of a Hamilton cycle. In particular, optimal pseudorandom conditions forcing not only Hamiltonicity, but also resilience and (approximate) Hamilton decompositions, and how symmetry also plays a role in the Hamiltonicity problem, as in the Lovász conjecture from 1969.\nSpeaker: Matías Pavez Signé (Universidad de Chile/CMM)\n\n
URL:https://www.cmm.uchile.cl/events/graph-theory-seminar-hamilton-cycles-in-sparse-graphs-between-randomness-and-symmetry/
ORGANIZER;CN=CMM:MAILTO:
CATEGORIES:Seminarios
LOCATION:Sala John Von Neumann, 7th floor, Beauchef 851
ATTACH;FMTTYPE=image/jpeg:https://www.cmm.uchile.cl/wp-content/uploads/2026/05/Optimizacion-y-equilibrio.jpg
END:VEVENT
END:VCALENDAR