Some Stability and Exact Results in Generalized Turán Problems

From MaRDI portal
Publication:6155585




Abstract: Given graphs H and F, the generalized Tur'an number mathrmex(n,H,F) is the largest number of copies of H in n-vertex F-free graphs. Stability refers to the usual phenomenon that if an n-vertex F-free graph G contains almost mathrmex(n,H,F) copies of H, than G is in some sense similar to some extremal graph. We obtain new stability results for generalized Tur'an problems and derive several new exact results.









This page was built for publication: Some Stability and Exact Results in Generalized Turán Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155585)