4 research outputs found
Packing Hamilton Cycles Online
It is known that w.h.p. the hitting time for the random
graph process to have minimum degree coincides with the hitting time
for edge disjoint Hamilton cycles. In this paper we prove an online
version of this property. We show that, for a fixed integer , if
random edges of are presented one by one then w.h.p. it is possible to
color the edges online with colors so that at time ,
each color class is Hamiltonian.Comment: Minor change