Some Stability and Exact Results in Generalized Turán Problems
From MaRDI portal
Publication:6155585
Abstract: Given graphs and , the generalized Tur'an number is the largest number of copies of in -vertex -free graphs. Stability refers to the usual phenomenon that if an -vertex -free graph contains almost copies of , than 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.
Recommendations
Cited in
(13)- Some exact results for regular Turán problems for all large orders
- A non-aligning variant of generalized Tur\'an problems
- Stability from graph symmetrization arguments in generalized Turán problems
- The cycle of length four is strictly \(F\)-Turán-good
- Stability version of Dirac's theorem and its applications for generalized Turán problems
- Some exact results for non-degenerate generalized Turán problems
- Generalized regular Turán numbers
- An extension of Turán's theorem, uniqueness and stability
- A localized approach to generalized Turán problems
- On the extremal graphs in generalized Tur\'an problems
- On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph
- On supersaturation and stability for generalized Turán problems
- The generalized Turán number of spanning linear forests
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)