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:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20250930T163000
DTEND;TZID=Asia/Seoul:20250930T173000
DTSTAMP:20260416T124155
CREATED:20250822T151431Z
LAST-MODIFIED:20250902T021816Z
UID:11444-1759249800-1759253400@dimag.ibs.re.kr
SUMMARY:Marcelo Sales\, On the Ramsey number of Daisies and other hypergraphs
DESCRIPTION:Given a $k$-uniform hypergraph $H$\, the Ramsey number $R(H;q)$ is the smallest integer $N$ such that any $q$-coloring of the edges of the complete $k$-uniform hypergraph on $N$ vertices contains a monochromatic copy of $H$. \nWhen $H$ is a complete hypergraph\, a classical argument of Erdős\, Hajnal\, and Rado reduces the general problem to the case of uniformity $k = 3$. In this talk\, we will survey constructions that lift Ramsey numbers to higher uniformities and discuss recent progress on quantitative bounds for $R(H;q)$ for certain families of hypergraphs. \nThis is joint work with Ayush Basu\, Dániel Dobák\, Pavel Pudlák\, and Vojtěch Rödl.
URL:https://dimag.ibs.re.kr/event/2025-09-30/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR