Dániel Gerbner and Zoltán Nagy: Unified approach to the generalized Turán problem and supersaturation

Abstract:

In this talk we discuss two papers. The first (by D. Gerbner, Z.L. Nagy and M. Vizer) describes a unifying approach to the generalized Turán problem and supersaturation results in graph theory. The supersaturation-extremal function satex(n, F : m, G) is the least number of copies of a subgraph G an n-vertex graph can have, which contains at least m copies of F as a subgraph.
We present a survey, discuss previously known results and present several new ones.
The second paper (by D. Gerbner and B. Patkós) studies the generalized Tur\'an function ex(n,H,F) in the case both H and F are complete bipartite graphs
 
The zoom link:
https://zoom.us/j/91399666052?pwd=VCtmb0U0RVI5ckE4eXNHQkV0c1l0QT09
If needed, the passcode is 222823.