works on
graph decomposition 1hamilton cover 1hamilton cycles 1hitting time 1linear arboricity 1random graphs 1

From the 1 of 30 linked papers with an AI index.

activity
20242026
collaborators
Showing math.PRShow all

1 paper · 1 filter

math.PR2024

Hitting time of connectedness in the random hypercube process

Sahar Diskin, Michael Krivelevich

We present a short and self-contained proof of a classical result due to Bollobás (1990): in the random hypercube process, with high probability the hitting time of connectedness…