Joseph Briggs

activity

20162026

most citedRainbow odd cycles

6 citations · 11 across the 13 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016★ 2 cited

Packing Directed and Hamilton Cycles Online

Michael Anastos, Joseph Briggs

Consider a directed analogue of the random graph process on $n$ vertices, where the $n (n - 1)$ edges are ordered uniformly at random and revealed one at a time. It is known that w.h.…

math.CO2016

Packing Hamilton Cycles Online

Joseph Briggs, Alan Frieze, Michael Krivelevich +2

It is known that w.h.p. the hitting time $τ_{2 σ}$ for the random graph process to have minimum degree $2 σ$ coincides with the hitting time for $σ$ edge disjoint Hamilton cycles. In…