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:20260624T201938
END:STANDARD
END:VTIMEZONE
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
UID:MEC-85094ce519ee14bf8b29414943a05025@cmm.uchile.cl
DTSTART;TZID=America/Santiago:20260513T100000
DTEND;TZID=America/Santiago:20260513T120000
DTSTAMP:20260512T170053Z
CREATED:20260512
LAST-MODIFIED:20260512
PRIORITY:5
SEQUENCE:2
TRANSP:OPAQUE
SUMMARY:Graph Theory Seminar: Zero-Sum Ramsey Number of Bounded Degree Graphs
DESCRIPTION:Abstract: \nGiven a graph H, the classical Ramsey problem asks for the smallest integer n such that any red-blue colouring of the edges of a clique on n vertices contains a monochromatic copy of H. In 1990 Bialostocki and Dierker introduced an algebraic variant of this problem called zero-sum Ramsey theory, in which we instead colour the edges of the clique with elements of a finite abelian group and look for a copy of H such that the sum of the colours on its edges is 0.\nWe show that for any finite abelian group G and any graph H with bounded maximum degree, the zero-sum Ramsey number of H in G is linear in the number of edges of H. In this talk, we introduce the background of zero-sum Ramsey theory and give an outline of the proof used for this result. We highlight the difficulties when looking at general finite abelian groups, as opposed to cyclic groups, and explain how these can be overcome.\nThis is joint work with Xiaopan Lian, Alexandru Malekshahian and Andrey Shapiro.\n\nSpeaker: Jasmin Katz (LSE)\nWhen: Wednesday, May 13, 2026, 10:00 AM\nVenue: John von Neumann Room, 7th Floor, CMM\n \n
URL:https://www.cmm.uchile.cl/events/seminario-de-grafos-zero-sum-ramsey-number-of-bounded-degree-graphs/
END:VEVENT
END:VCALENDAR