Feb. 16, 3:30pm, Wean 8220

Joseph Briggs, CMU

Coloring directed Hamilton cycles online

Joseph Briggs, CMU

Coloring directed Hamilton cycles online

Abstract:

Consider a directed analogue of the random graph process on *n*
vertices, whereby the *n ^{2}*-

In particular, for a fixed *q*=*O*(*1*), we wish to study the hitting time for
the emergence of *q* edge-disjoint directed Hamilton cycles. This is the
smallest *X* for which *D _{X}* contains

Consider an online coloring process in which each newly appearing edge of
*D _{i}* is painted irrevocably with one of

Before the talk, at 3:10pm, there will be tea and cookies in Wean 6220.