The Ramsey number of a graph $G$ is the minimum integer $n$ for
which every edge-coloring of the complete graph on $n$ vertices
with two colors contains a monochromatic copy of $G$. A graph is
$d$-degenerate if all its subgraphs have a vertex of...
Read More
