The reviewed record of science sign in
Pith

arxiv: 2210.08534 · v2 · pith:3FWCU6WS · submitted 2022-10-16 · math.CO

Rainbow powers of a Hamilton cycle in G(n,p)

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3FWCU6WSrecord.jsonopen to challenge →

classification math.CO
keywords copycyclehamiltonrainbowthresholdcoloredcolorsconstant
0
0 comments X
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.