See by year See by month Jump to month

Füredi Zoltán (Rényi Intézet): Induced Turán problems for hypergraphs

Download as iCal file
Friday, 10. May 2019, 10:00 - 12:00

Let F be a graph. We say that a hypergraph H contains an {induced Berge} F if there exists an injective mapping f from the edges of F to the hyperedges of H such that if xy \in E(G), then f(xy) \cap 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.
Location : Bolyai Intézet, I. emelet, Riesz terem, Aradi vértanúk tere 1., Szeged


JEvents v3.1.8 Stable   Copyright © 2006-2013