# 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: 2024-07-15 Mon 01:28