Key points are not available for this paper at this time.
Given graphs H and F , the generalized Tur án number ex(n, H, F ) is the largest number of copies of H in n-vertex F -free graphs.This paper is concerned with the case when either H or F is a matching.Several asymptotic and exact results are obtained.
A Tue, study studied this question.