Tag Archives: Brendan D. McKay

R(5,5) ≤ 48

The Ramsey numbers R(s,t) The Ramsey number R(s, t) is defined to be the smallest n such that every graph of order n contains either a clique of s vertices or an independent set of t vertices. Understanding the values … Continue reading

Posted in Combinatorics, Open problems, Updates | Tagged , | Leave a comment