Claims

../

1994_07_01_alon: Alon's 1994 theorem that a graph on n vertices with no two adjacent vertices of degree at least three has two-color Ramsey number at most 12n, answering Problem 800 yes; refereed in J. Graph Theory 18 (1994), credited by the site.

1997_06_01_li_rousseau_soltes: Li, Rousseau and Šoltés's 1997 theorem that a graph on n vertices whose vertices of degree at least three are independent has two-color Ramsey number at most 6n, answering Problem 800 yes; refereed, read at abstract depth only.

---