-
Rényi, Nagyterem + Zoom
-
-
-
-
-
-
Description
Absztrakt:
Very recently, Alon and Frankl initiated the study of the maximum
number of edges in n-vertex F-free graphs with matching number at most
s. For fixed F and s, we determine this number apart from a constant
additive term. We also obtain several exact results.