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:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20210401T100000
DTEND;TZID=Asia/Seoul:20210401T110000
DTSTAMP:20260420T162116
CREATED:20210218T001134Z
LAST-MODIFIED:20240705T191014Z
UID:3642-1617271200-1617274800@dimag.ibs.re.kr
SUMMARY:Sophie Spirkl\, Pure pairs in ordered graphs
DESCRIPTION:A pure pair in a graph G is a pair of subsets A\, B of the vertex set of G such that in G\, either all of the edges or none of the edges between A and B are present. Pure pairs have been studied recently motivated by their connections to the Erdos-Hajnal conjecture. \nIn this talk\, I will discuss the topic of pure pairs in ordered graphs\, that is\, graphs with a linear ordering on their vertex set. If we exclude a graph H as an ordered induced subgraph\, how large a pure pair can we guarantee? I will talk about how the answer differs from the case of unordered graphs and show some of the techniques used. \nBased on joint work with Maria Chudnovsky\, Jacob Fox\, Alex Scott\, and Paul Seymour.
URL:https://dimag.ibs.re.kr/event/2021-04-01/
LOCATION:Zoom ID: 869 4632 6610 (ibsdimag)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
END:VCALENDAR