Turán graphs with bounded matching number

10/26/2022

∙

by   Noga Alon, et al.

∙

0

∙

share

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.