--
Lyuben Lichev
(University Jean Monnet, Saint-Etienne)
In a recent breakthrough, Montgomery showed that the Erdos-Rényi random graph G(n,p) typically contains all n-vertex trees of maximum degree Delta slightly above the (sharp) connectivity threshold.
We consider the random geometric graph G_d(n,r) obtained by independently assigning a uniformly random position in [0,1]^d ...
