On the sizes of t-intersecting k-chain-free families
Patkós BalázsExtremal Set Systems Seminar
on 10/6/22
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.
