R. Montgomery

collaborators

2 papers

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 $I^ (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…

math.CO2025

Global rigidity of random graphs in $R$

Richard Montgomery, Rajko Nenadov, Julien Portier +1

We investigate the problem of reconstructing a set $P \subseteq R$ of distinct points, where the only information available about $P$ consists of the distances between some…

Ramsey numbers of trees

Global rigidity of random graphs in R

Global rigidity of random graphs in $R$