Yahav Alon

According to our database, Yahav Alon authored at least 9 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs.

Yahav Alon, Michael Anastos

Random Struct. Algorithms, March, 2025

Sparse Pancyclic Subgraphs of Random Graphs.

Yahav Alon, Michael Krivelevich

SIAM J. Discret. Math., 2025

2024

Hamilton completion and the path cover number of sparse random graphs.

Yahav Alon, Michael Krivelevich

Eur. J. Comb., 2024

2023

The Global Resilience of Hamiltonicity in G(n, p).

Yahav Alon

Graphs Comb., October, 2023

2022

Spanning Trees at the Connectivity Threshold.

Yahav Alon, Michael Krivelevich, Peleg Michaeli

SIAM J. Discret. Math., 2022

Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs.

Yahav Alon, Michael Krivelevich

SIAM J. Discret. Math., 2022

Cycle lengths in sparse random graphs.

Yahav Alon, Michael Krivelevich, Eyal Lubetzky

Random Struct. Algorithms, 2022

2020

Finding a Hamilton cycle fast on average using rotations and extensions.

Yahav Alon, Michael Krivelevich

Random Struct. Algorithms, 2020

Random Graph's Hamiltonicity is Strongly Tied to its Minimum Degree.

Yahav Alon, Michael Krivelevich

Electron. J. Comb., 2020