Simonovits Miklós: How to solve a Turán type extremal graph problem?
Simonovits MiklósKombinatorika szeminárium
on 12/2/21
The generalized Turán number ex(n,H,F) is the largest number of copies of H in F-free n-vertex graphs.
We present some stability results concerning this parameter and show how they can be used to obtain exact results.
