Generalized Tur\'an results for matchings
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.