Rainbow perfect matchings and Hamilton cycles in the random geometric graph

Deepak Bal, Patrick Bennett, Xavier Pérez-Giménez +1

Given a graph on $n$ vertices and an assignment of colours to the edges, a rainbow Hamilton cycle is a cycle of length $n$ visiting each vertex once and with pairwise different col…