R. Montgomery

activity

20232025

most citedRamsey numbers of bounded degree trees versus general graphs

6 citations · 8 across the 4 of their papers we have counts for

collaborators

Showing 2025Show all

1 paper · 1 filter

math.CO2025

Ramsey numbers of trees

Richard Montgomery, Matías Pavez-Signé, Jun Yan

We show that there exists a constant $c > 0$ such that every $n$ -vertex tree $T$ with $Δ (T) \leq c n$ has Ramsey number $R (T) = max {t_{1} + 2 t_{2}, 2 t_{1}} - 1$ , where $t_{1} \geq t_{2}$ are the sizes…