Andrzej Grzesik: Generalized Turán problem for cycles

The generalized Turán problem asks for the largest number of copies of a graph H in an n-vertex graph not containing a graph F as a subgraph. In the talk we will discuss this problem in the case when both H and F are cycles. We will present known bounds and recent developments, including the first exact estimation in the sparse setting.
The talk is based on joint works with Bartłomiej Kielak and Mateusz Górski.