1. Cycle lengths in sparse random graphs. Issue 3 (8th December 2021) Authors: Alon, Yahav; Krivelevich, Michael; Lubetzky, Eyal Journal: Random structures & algorithms Issue: Volume 61:Issue 3(2022) Page Start: 444 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Finding a Hamilton cycle fast on average using rotations and extensions. Issue 1 (16th March 2020) Authors: Alon, Yahav; Krivelevich, Michael Journal: Random structures & algorithms Issue: Volume 57:Issue 1(2020) Page Start: 32 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗