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:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240227T163000
DTEND;TZID=Asia/Seoul:20240227T173000
DTSTAMP:20260418T054705
CREATED:20231225T014547Z
LAST-MODIFIED:20240705T154141Z
UID:8054-1709051400-1709055000@dimag.ibs.re.kr
SUMMARY:Jie Han (韩杰)\, Perfect matchings in dense uniform hypergraphs
DESCRIPTION:There has been a raising interest on the study of perfect matchings in uniform hypergraphs in the past two decades\, including extremal problems and their algorithmic versions. I will introduce the problems and some recent developments.
URL:https://dimag.ibs.re.kr/event/2024-02-27/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR