P
Initializing...
Theorem 1.1 — for $n\ge2s+1$ the maximum number of edges with clique number $\le k$ and matching number $\le s$ is $\max\{t(2s+1,k),g(n,k,s)\}$ · Prove2Me