On rainbow thresholds

Resolving a recent problem of Bell, Frieze, and Marbach, we establish both the threshold result of Frankston–Kahn–Narayanan–Park, and its strengthening by Spiro, in the rainbow setting. This has applications to the thresholds for rainbow structures in random graphs where each edge is given a uniformly random color from a set of given colors.