Machine learning and discrete mathematics: a case study in error-correcting codes (in Hungarian)
Turán GyörgyKombinatorika szeminárium
on 10/27/22
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.
