A degree version of the Burr-Erdős conjecture on trees

Jasmin Katz, Matías Pavez-Signé, Jozef Skokan

An old conjecture of Burr and Erd\H os states that the Ramsey number of any $n$-vertex tree $T$ is at most $2n-2$. In 2012, Schelp asked whether a degree version of the Burr--Erdős…