Rainbow powers of a Hamilton cycle in G(n,p)
Combinatorics
2024-03-04 v2
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 is within a constant factor of the uncolored threshold. Our proof requires times the minimum number of colors.
Cite
@article{arxiv.2210.08534,
title = {Rainbow powers of a Hamilton cycle in G(n,p)},
author = {Tolson Bell and Alan Frieze},
journal= {arXiv preprint arXiv:2210.08534},
year = {2024}
}
Comments
9 pages