pub fn ramsey_number(s: usize, t: usize) -> Option<usize>Expand description
The known two-colour Ramsey numbers R(s, t) for the small (s, t) we can actually build CNFs for
(symmetric: R(s, t) = R(t, s)); None when the value is still an open problem. R(s, t) is the
least n such that every red/blue colouring of K_n’s edges contains a red K_s or a blue K_t.