论文信息 - Turán graphs with bounded matching number

Turán graphs with bounded matching number

We determine the maximum possible number of edges of a graph with n vertices, matching number at most s and clique number at most k for all admissible values of the parameters.

N. Alon | P. Frankl

[1] L. Lovász. Matching Theory (North-Holland mathematics studies) , 1986 .

[2] Paul Erdös,et al. On an extremal problem in graph theory , 1970 .

[3] P. Erdgs,et al. ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS , 2002 .

[4] L. Moser,et al. AN EXTREMAL PROBLEM IN GRAPH THEORY , 2001 .