Despite dying tragically young, Ramsey was influential in mathematics, philosophy, and economics. Ramsey’s Theorem states that there is a number R(m,n) such that every colouring with two colours of the edges of a complete graph with R(m,n) vertices has a collection of m vertices with all edges between them being the first colour or a similar collection with n vertices for the second colour. In practice, these Ramsey numbers are difficult to calculate, even for small values of m and n.