Rainbow powers of a Hamilton cycle in G(n,p)
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 Gn,p is within a constant factor of the uncolored threshold. Our proof requires (1+) times the minimum number of colors.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.