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:20230718T163000
DTEND;TZID=Asia/Seoul:20230718T173000
DTSTAMP:20260419T042601
CREATED:20230601T142456Z
LAST-MODIFIED:20240705T163017Z
UID:7226-1689697800-1689701400@dimag.ibs.re.kr
SUMMARY:Andrzej Grzesik\, Rainbow Turán problems
DESCRIPTION:In a rainbow variant of the Turán problem\, we consider $k$ graphs on the same set of vertices and want to determine the smallest possible number of edges in each graph\, which guarantees the existence of a copy of a given graph $F$ containing at most one edge from each graph. In other words\, we treat each of the $k$ graphs as a graph in one of the $k$ colors and consider how many edges in each color force a rainbow copy of a given graph $F$. In the talk\, we will describe known results on the topic\, as well as present recent developments\, obtained jointly with Sebastian Babiński and Magdalen Prorok\, solving the rainbow Turán problem for a path on 4 vertices and a directed triangle with any number of colors.
URL:https://dimag.ibs.re.kr/event/2023-07-18/
LOCATION:Room S221\, IBS (기초과학연구원) Science Culture Center
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR