BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv5.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for 
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20240124T153000
DTEND;TZID=UTC:20240124T163000
DTSTAMP:20260609T083043
CREATED:20240118T184108Z
LAST-MODIFIED:20240118T184230Z
UID:7478-1706110200-1706113800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker: Torsten Mütze\, Un. Warwick\nTitle: Kneser graphs are Hamiltonian\n  \nAbstract: For integers k>=1 and n>=2k+1\, the Kneser graph K(n\,k) has as vertices all k-element subsets of an n-element ground set\, and an edge between any two disjoint sets. It has been conjectured since the 1970s that all Kneser graphs admit a Hamilton cycle\, with one notable exception\, namely the Petersen graph K(5\,2). This problem received considerable attention in the literature\, including a recent solution for the sparsest case n=2k+1. The main contribution of our work is to prove the conjecture in full generality. We also extend this Hamiltonicity result to all connected generalized Johnson graphs (except the Petersen graph). The generalized Johnson graph J(n\,k\,s) has as vertices all k-element subsets of an n-element ground set\, and an edge between any two sets whose intersection has size exactly s. Clearly\, we have K(n\,k)=J(n\,k\,0)\, i.e.\, generalized Johnson graphs include Kneser graphs as a special case. Our results imply that all known families of vertex-transitive graphs defined by intersecting set systems have a Hamilton cycle\, which settles an interesting special case of Lovász’ conjecture on Hamilton cycles in vertex-transitive graphs from 1970. Our main technical innovation is to study cycles in Kneser graphs by a kinetic system of multiple gliders that move at different speeds and that interact over time\, reminiscent of the gliders in Conway’s Game of Life\, and to analyze this system combinatorially and via linear algebra.\n  \nThis is joint work with my students Arturo Merino (TU Berlin) and Namrata (Warwick).\n\n———————————————————\nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-8/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette%20Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
END:VCALENDAR