Survey of Generalized Turán Problems — Counting Subgraphs
Abstract
For fixed graphs $H$ and $F$, the generalized Turán number $\mathrm{ex}(n,H,F)$ is the maximum possible number of copies of a subgraph $H$ in an $n$-vertex $F$-free graph. This article is a survey of this extremal function whose study was initiated in an influential 2016 article by Alon and Shikhelm [J. Combin. Theory, B, 121, 2016].
Fields of Study & Subjects
Limits and Structures in Graph Theory
Markov Chains and Monte Carlo Methods
Advanced Graph Theory Research
Publication details
- Journal / source
- The Electronic Journal of Combinatorics
- Publisher
- The Electronic Journal of Combinatorics
- Volume
- 1000
- Publication date
- 13 February 2026