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:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20260324T163000
DTEND;TZID=Asia/Seoul:20260324T173000
DTSTAMP:20260417T221940
CREATED:20251114T231517Z
LAST-MODIFIED:20260227T004232Z
UID:11858-1774369800-1774373400@dimag.ibs.re.kr
SUMMARY:Hidde Koerts\, Characterizing large clique number in tournaments
DESCRIPTION:A backedge graph of a tournament $T$ with respect to a total ordering $\prec$ of the vertices of $T$ is a graph on $V(T)$ where $uv$ is an edge if and only if $uv \in A(T)$ and $v \prec u$. In 2023\, Aboulker\, Aubian\, Charbit and Lopes introduced the clique number of tournaments based on backedge graphs as a natural counterpart to the dichromatic number of tournaments. Specifically\, the clique number of a tournament is the minimum clique number of a backedge graph when considering all possible orderings. \nGiven this definition\, it is not immediately clear what the canonical clique object should be. In this talk\, we provide an answer to this question. We show that if a tournament has large clique number\, it contains a reasonably large subtournament from one of two simple and previously studied families of tournaments of unbounded clique number. \nThis talk is based on joint work with Logan Crew\, Xinyue Fan\, Benjamin Moore\, and Sophie Spirkl.
URL:https://dimag.ibs.re.kr/event/2026-03-24/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR