Yahav Alon

activity

20182023

most citedThe completion numbers of Hamiltonicity and pancyclicity in random graphs

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

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs

Yahav Alon, Michael Krivelevich

Consider the random subgraph process on a base graph $G$ on $n$ vertices: a sequence ${G_{t}}_{t = 0}^{∣ E (G) ∣}$ of random subgraphs of $G$ obtained by choosing an order…

math.CO2019

Finding a Hamilton cycle fast on average using rotations and extensions

Yahav Alon, Michael Krivelevich

We present an algorithm CRE, which either finds a Hamilton cycle in a graph $G$ or determines that there is no such cycle in the graph. The algorithm's expected running time over i…