Extremal Theorems for Trees and Cycles in Hypergraphs

Graphs, Hypergraphs, and Computing

04 February 14:00 - 15:00

Jacques Verstraete - University of California, San Diego

In this talk we determine the asymptotic solution to an extremal problem in hypergraphs involving a generalization of trees and cycles in graphs, answering conjectures of Furedi and Furedi, Jiang and Seiver. A general approach is presented, and related open extremal problems for trees and cycles in hypergraphs are discussed.

Joint work with Dhruv Mubayi and Sasha Kostochka
Magnus M. Halldorsson
Reykjavik University
Klas Markström
Umeå University
Andrzej Rucinski
Adam Mickiewicz University
Carsten Thomassen
Technical University of Denmark, DTU


Klas Markström


For practical matters at the Institute, send an e-mail to