BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230427T161500
DTEND;TZID=Asia/Seoul:20230427T171500
DTSTAMP:20260419T094521
CREATED:20230321T001954Z
LAST-MODIFIED:20240705T164205Z
UID:6930-1682612100-1682615700@dimag.ibs.re.kr
SUMMARY:Rob Morris\, Ramsey theory: searching for order in chaos
DESCRIPTION:In many different areas of mathematics (such as number theory\, discrete geometry\, and combinatorics)\, one is often presented with a large “unstructured” object\, and asked to find a smaller “structured” object inside it. One of the earliest and most influential examples of this phenomenon was the theorem of Ramsey\, proved in 1930\, which states that if n = n(k) is large enough\, then in any red-blue colouring of the edges of the complete graph on n vertices\, there exists a monochromatic clique on k vertices. In this talk I will discuss some of the questions\, ideas\, and new techniques that were inspired by this theorem\, and present some recent progress on one of the central problems in the area: bounding the so-called “diagonal” Ramsey numbers. Based on joint work with Marcelo Campos\, Simon Griffiths and Julian Sahasrabudhe.
URL:https://dimag.ibs.re.kr/event/2023-04-27/
LOCATION:Room 1501\, Bldg. E6-1\, KAIST
CATEGORIES:Colloquium
END:VEVENT
END:VCALENDAR