| Cycle lengths in sparse random graphs Y Alon, M Krivelevich, E Lubetzky Random Structures & Algorithms 61 (3), 444-461, 2022 | 9 | 2022 |
| Finding a Hamilton cycle fast on average using rotations and extensions Y Alon, M Krivelevich Random Structures & Algorithms 57 (1), 32-46, 2020 | 9 | 2020 |
| Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs Y Alon, M Krivelevich SIAM Journal on Discrete Mathematics 36 (1), 728-754, 2022 | 8 | 2022 |
| Random graph's Hamiltonicity is strongly tied to its minimum degree Y Alon, M Krivelevich arXiv preprint arXiv:1810.04987, 2018 | 7 | 2018 |
| Hamilton completion and the path cover number of sparse random graphs Y Alon, M Krivelevich European Journal of Combinatorics 118, 103934, 2024 | 1 | 2024 |
| The completion numbers of Hamiltonicity and pancyclicity in random graphs Y Alon, M Anastos arXiv preprint arXiv:2304.03710, 2023 | 1 | 2023 |
| The Global Resilience of Hamiltonicity in G(n, p) Y Alon Graphs and Combinatorics 39 (5), 107, 2023 | | 2023 |
| Sparse pancyclic subgraphs of random graphs Y Alon, M Krivelevich arXiv preprint arXiv:2308.01564, 2023 | | 2023 |
| Two-round Ramsey games on random graphs Y Alon, P Morris, W Samotij arXiv preprint arXiv:2305.02725, 2023 | | 2023 |
| Spanning trees at the connectivity threshold Y Alon, M Krivelevich, P Michaeli SIAM Journal on Discrete Mathematics 36 (3), 1612-1626, 2022 | | 2022 |
