Given graphs H and F, the generalized Tur\'an number ex(n,H,F) is the largest number of copies of H in n-vertex F-free graphs. We study the case when either H or F is a matching. We obtain several asymptotic and exact results.
No takes yet. Share an insight, caveat, or question.
Dániel Gerbner (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: