Good Graph Hunting

Philip Garrison

Given graphs $H_1,H_2,\dots ,H_k$, the Ramsey number $R(H_1,\dots ,H_k)$ is the smallest integer $n$ for which in any coloring of the edges of the complete graph $K_n$ with colo…