Generalized Tur\'an results for matchings
Combinatorics
2024-04-23 v1
Abstract
Given graphs and , the generalized Tur\'an number is the largest number of copies of in -vertex -free graphs. We study the case when either or is a matching. We obtain several asymptotic and exact results.
Cite
@article{arxiv.2404.13335,
title = {Generalized Tur\'an results for matchings},
author = {Dániel Gerbner},
journal= {arXiv preprint arXiv:2404.13335},
year = {2024}
}