Rainbow powers of a Hamilton cycle in G(n,p)
pith:3FWCU6WSopen to challenge →
classification
math.CO
keywords
copycyclehamiltonrainbowthresholdcoloredcolorsconstant
read the original abstract
We show that the threshold for having a rainbow copy of a power of a Hamilton cycle in a randomly edge colored copy of $G_{n,p}$ is within a constant factor of the uncolored threshold. Our proof requires $(1+\varepsilon)$ times the minimum number of colors.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.