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:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240206T163000
DTEND;TZID=Asia/Seoul:20240206T173000
DTSTAMP:20260418T060505
CREATED:20231109T130523Z
LAST-MODIFIED:20240707T072539Z
UID:7892-1707237000-1707240600@dimag.ibs.re.kr
SUMMARY:Ander Lamaison\, Uniform Turán density beyond 3-graphs
DESCRIPTION:The uniform Turán density $\pi_u(F)$ of a hypergraph $F$\, introduced by Erdős and Sós\, is the smallest value of $d$ such that any hypergraph $H$ where all linear-sized subsets of vertices of $H$ have density greater than $d$ contains $F$ as a subgraph. Over the past few years the  value of $\pi_u(F)$ was determined for several classes of 3-graphs\, but no nonzero value of $\pi_u(F)$ has been found for $r$-graphs with $r>3$. In this talk we show the existence of $r$-graphs $F$ with $\pi_u(F)={r \choose 2}^{-{r \choose 2}}$\, which we conjecture is minimum possible. Joint work with Frederik Garbe\, Daniel Il’kovic\, Dan Král’ and Filip Kučerák.
URL:https://dimag.ibs.re.kr/event/2024-02-06/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240214T163000
DTEND;TZID=Asia/Seoul:20240214T173000
DTSTAMP:20260418T060505
CREATED:20240207T080327Z
LAST-MODIFIED:20240707T072533Z
UID:8230-1707928200-1707931800@dimag.ibs.re.kr
SUMMARY:Sebastian Wiederrecht\, Packing even directed circuits quarter-integrally
DESCRIPTION:We prove the existence of a computable function $f\colon\mathbb{N}\to\mathbb{N}$ such that for every integer $k$ and every digraph $D$ either contains a collection $\mathcal{C}$ of $k$ directed cycles of even length such that no vertex of $D$ belongs to more than four cycles in $\mathcal{C}$\, or there exists a set $S\subseteq V(D)$ of size at most $f(k)$ such that $D-S$ has no directed cycle of even length. \nThis is joint work with Maximilian Gorsky\, Ken-ichi Kawarabayashi\, and Stephan Kreutzer.
URL:https://dimag.ibs.re.kr/event/2024-02-14/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240227T163000
DTEND;TZID=Asia/Seoul:20240227T173000
DTSTAMP:20260418T060505
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