BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
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:20231010T163000
DTEND;TZID=Asia/Seoul:20231010T173000
DTSTAMP:20260418T225032
CREATED:20230917T133424Z
LAST-MODIFIED:20240705T161024Z
UID:7665-1696955400-1696959000@dimag.ibs.re.kr
SUMMARY:Domagoj Bradač\, Effective bounds for induced size-Ramsey numbers of cycles
DESCRIPTION:The k-color induced size-Ramsey number of a graph H is the smallest number of edges a (host) graph G can have such that for any k-coloring of its edges\, there exists a monochromatic copy of H which is an induced subgraph of G. In 1995\, in their seminal paper\, Haxell\, Kohayakawa and Łuczak showed that for cycles these numbers are linear for any constant number of colours\, i.e.\, for some C=C(k)\, there is a graph with at most Cn edges whose any k-edge-coloring contains a monochromatic induced cycle of length n. The value of C comes from the use of the sparse regularity lemma and has a tower-type dependence on k. In this work\, we obtain nearly optimal bounds for the required value of C. Joint work with Nemanja Draganić and Benny Sudakov.
URL:https://dimag.ibs.re.kr/event/2023-10-10/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR