BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.18.4.1//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:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20261117T163000
DTEND;TZID=Asia/Seoul:20261117T173000
DTSTAMP:20261108T131651Z
CREATED:20261012T112738Z
LAST-MODIFIED:20261108T131651Z
UID:13607-1794933000-1794936600@dimag.ibs.re.kr
SUMMARY:Joonkyung Lee (이준경)\, The positive graph theorem
DESCRIPTION:A graph H is said to be positive if its homomorphism density tH(W) is non-negative for every bounded symmetric measurable function W:[0\,1]2 → ℝ. Antolín Camarena\, Csóka\, Hubai\, Lippner and Lovász conjectured that a graph is positive if and only if it can be obtained by gluing two copies of the same graph along an independent set. I will present a proof of this conjecture. This is joint work with David Conlon.
URL:https://dimag.ibs.re.kr/event/2026-11-17/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR