Rainbow powers of a Hamilton cycle in G n,p

Rainbow powers of a Hamilton cycle in G n,p

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of graph theory 2024-04, Vol.105 (4), p.491-500
Hauptverfasser: Bell, Tolson, Frieze, Alan
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.23054