Yahav Alon

According to our database1, Yahav Alon authored at least 7 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Hamilton completion and the path cover number of sparse random graphs.
Eur. J. Comb., 2024

2023
The Global Resilience of Hamiltonicity in G(n, p).
Graphs Comb., October, 2023

2022
Spanning Trees at the Connectivity Threshold.
SIAM J. Discret. Math., 2022

Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs.
SIAM J. Discret. Math., 2022

Cycle lengths in sparse random graphs.
Random Struct. Algorithms, 2022

2020
Finding a Hamilton cycle fast on average using rotations and extensions.
Random Struct. Algorithms, 2020

Random Graph's Hamiltonicity is Strongly Tied to its Minimum Degree.
Electron. J. Comb., 2020


  Loading...