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:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20191119T163000
DTEND;TZID=Asia/Seoul:20191119T173000
DTSTAMP:20260420T184416
CREATED:20190924T042207Z
LAST-MODIFIED:20240707T084346Z
UID:1430-1574181000-1574184600@dimag.ibs.re.kr
SUMMARY:Ruth Luo\, Induced Turán problems for hypergraphs
DESCRIPTION:Let $F$ be a graph. We say that a hypergraph $\mathcal H$ is an induced Berge $F$ if there exists a bijective mapping $f$ from the edges of $F$ to the hyperedges of $\mathcal H$ such that for all $xy \in E(F)$\, $f(xy) \cap V(F) = \{x\,y\}$. In this talk\, we show asymptotics for the maximum number of edges in $r$-uniform hypergraphs with no induced Berge $F$. In particular\, this function is strongly related to the generalized Turán function $ex(n\,K_r\, F)$\, i.e.\, the maximum number of cliques of size $r$ in $n$-vertex\, $F$-free graphs.  Joint work with Zoltan Füredi.
URL:https://dimag.ibs.re.kr/event/2019-11-19/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR