BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Claremont Center for the Mathematical Sciences
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20220313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20221106T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230926T121500
DTEND;TZID=America/Los_Angeles:20230926T131000
DTSTAMP:20260524T235649
CREATED:20230828T163632Z
LAST-MODIFIED:20230828T211001Z
UID:3153-1695730500-1695733800@colleges.claremont.edu
SUMMARY:Chromatic numbers of abelian Cayley graphs (Michael Krebs\, Cal State LA)
DESCRIPTION:A classic problem in graph theory is to find the chromatic number of a given graph: that is\, to find the smallest number of colors needed to assign every vertex a color such that whenever two vertices are adjacent\, they receive different colors.  This problem has been studied for many families of graphs\, including cube-like graphs\, unit-distance graphs\, circulant graphs\, integer distance graphs\, Paley graphs\, unit-quadrance graphs\, etc.  All of those examples just listed can be regarded as “abelian Cayley graphs\,” that is\, Cayley graphs whose underlying group is abelian.  Our goal is to create a unified\, systematic approach for dealing with problems of this sort\, rather than attacking each individually with ad hoc methods.  Building upon the work of Heuberger\, we associate an integer matrix to each abelian Cayley graph.  In certain cases\, such as when the matrix is small enough\, we can more or less read the chromatic number directly from the entries of the matrix.  In this way we immediately recover both Payan’s theorem (that cubelike graphs cannot have chromatic number 4) as well as Zhu’s theorem (which determines the chromatic number of six-valent integer distance graphs).  The proofs utilize only elementary group theory\, elementary graph theory\, elementary number theory\, and elementary linear algebra.  This is joint work with J. Cervantes.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-michael-krebs-cal-state-la/
LOCATION:Roberts North 102\, CMC
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR