BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Budapest
END:VTIMEZONE
BEGIN:VEVENT
UID:34srfvccqjb7jn40b5othmhb3o@google.com
CATEGORIES:{lang hu}Kombinatorika szeminárium{/lang}{lang en}Combinatorics seminar{/lang}
SUMMARY:Füredi Zoltán (Rényi Intézet): Induced Turán problems for hypergraphs
LOCATION:Bolyai Intézet, I. emelet, Riesz terem, Aradi vértanúk tere 1., Szeged
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:
Abstract.
Let F be a graph. We say that a hypergraph H contai
ns an {induced Berge} F if there exists an injective mapping f from the ed
ges of F to the hyperedges of H such that if xy \in E(G), then f(xy) \c
ap V(F) = {x,y}. We show that the maximum number of edges in an $r$-uniform
hypergraph with no induced Berge F is strongly related to the generalized
Turán function ex(n,K_r, F). (I.e., the maximum number of K_r's in an F-
free graph on n vertices).
A joint work with Ruth Luo.
DTSTAMP:20240329T142218Z
DTSTART;TZID=Europe/Budapest:20190510T100000
DTEND;TZID=Europe/Budapest:20190510T120000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR