The Combinatorial Nullstellensatz applied to the Erdős-Faber-Lovász conjecture and other applications in graph theory
Nagy Zoltán LórántKombinatorika szeminárium
on 3/3/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.
