Ramsey Number
The Ramsey number \(R(a,b)\) is the smallest \(n\) such that any graph of size \(n\) either contains a clique \(K_a\) of size \(a\) or an independent set \(\overline{K_b}\) of size \(b\).
The Ramsey number \(R(a,b)\) is the smallest \(n\) such that any graph of size \(n\) either contains a clique \(K_a\) of size \(a\) or an independent set \(\overline{K_b}\) of size \(b\).
Created: 2021-09-14 Tue 21:44