1. A Construction of Almost Steiner Systems. Issue 11 (10th November 2013) Authors: Ferber, Asaf; Hod, Rani; Krivelevich, Michael; Sudakov, Benny Journal: Journal of combinatorial designs Issue: Volume 22:Issue 11(2014:Nov.) Page Start: 488 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Asymptotics in percolation on high‐girth expanders. Issue 4 (6th January 2020) Authors: Krivelevich, Michael; Lubetzky, Eyal; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 56:Issue 4(2020) Page Start: 927 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Biased games on random boards1. Issue 4 (24th February 2014) Authors: Ferber, Asaf; Glebov, Roman; Krivelevich, Michael; Naor, Alon Journal: Random structures & algorithms Issue: Volume 46:Issue 4(2015) Page Start: 651 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Clique coloring of dense random graphs. Issue 3 (28th November 2017) Authors: Alon, Noga; Krivelevich, Michael Journal: Journal of graph theory Issue: Volume 88:Issue 3(2018) Page Start: 428 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Color‐biased Hamilton cycles in random graphs. Issue 3 (21st August 2021) Authors: Gishboliner, Lior; Krivelevich, Michael; Michaeli, Peleg Journal: Random structures & algorithms Issue: Volume 60:Issue 3(2022) Page Start: 289 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. Compatible Hamilton cycles in random graphs1. Issue 3 (15th February 2016) Authors: Krivelevich, Michael; Lee, Choongbum; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 49:Issue 3(2016) Page Start: 533 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. Complete Minors in Graphs Without Sparse Cuts. (20th May 2019) Authors: Krivelevich, Michael; Nenadov, Rajko Journal: International mathematics research notices Issue: Volume 2021:Number 12(2021) Page Start: 8996 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. Cores of random graphs are born Hamiltonian. Issue 1 (3rd March 2014) Authors: Krivelevich, Michael; Lubetzky, Eyal; Sudakov, Benny Journal: Proceedings of the London Mathematical Society Issue: Volume 109:Issue 1(2014:Jul.) Page Start: 161 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. 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) ↗
10. Divisible subdivisions. Issue 4 (29th July 2021) Authors: Alon, Noga; Krivelevich, Michael Journal: Journal of graph theory Issue: Volume 98:Issue 4(2021) Page Start: 623 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗