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:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200526T163000
DTEND;TZID=Asia/Seoul:20200526T173000
DTSTAMP:20260420T063645
CREATED:20200507T062724Z
LAST-MODIFIED:20240705T201016Z
UID:2430-1590510600-1590514200@dimag.ibs.re.kr
SUMMARY:Hong Liu (刘鸿)\, Asymptotic Structure for the Clique Density Theorem
DESCRIPTION:The famous Erdős-Rademacher problem asks for the smallest number of r-cliques in a graph with the given number of vertices and edges. Despite decades of active attempts\, the asymptotic value of this extremal function for all r was determined only recently\, by Reiher [Annals of Mathematics\, 184 (2016) 683-707]. Here we describe the asymptotic structure of all almost extremal graphs. This task for r=3 was previously accomplished by Pikhurko and Razborov [Combinatorics\, Probability and Computing\, 26 (2017) 138–160].
URL:https://dimag.ibs.re.kr/event/2020-05-26/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR