Some Stability and Exact Results in Generalized Turán Problems

DOI10.1556/012.2023.01533arXiv2204.04600MaRDI QIDQ6155585FDOQ6155585

Authors: Dániel Gerbner 

Publication date: 5 June 2023

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2204.04600

zbMATH Keywords

stabilitygeneralized TuránTurán-good

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (8)

• On supersaturation and stability for generalized Turán problems
• On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph
• The generalized Turán number of spanning linear forests
• The cycle of length four is strictly \(F\)-Turán-good
• An extension of Turán's theorem, uniqueness and stability
• Stability from graph symmetrization arguments in generalized Turán problems
• Stability version of Dirac's theorem and its applications for generalized Turán problems
• Some exact results for non-degenerate generalized Turán problems

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)