Tag Archives: Ramsey theory

Choongbum Lee proved the Burr-Erdős conjecture

Let be a graph. The Ramsey number is the smallest such that whenever you color the edges of the complete graph with vertices with two colors blue and red, you can either find a blue copy or a red copy … Continue reading

Posted in Combinatorics, Updates | Tagged , | 2 Comments