1. 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) ↗
2. Clique minors in graphs with a forbidden subgraph. Issue 3 (16th August 2021) Authors: Bucić, Matija; Fox, Jacob; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 60:Issue 3(2022) Page Start: 327 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. 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) ↗
4. Counting Hamilton cycles in sparse random directed graphs. Issue 4 (18th October 2018) Authors: Ferber, Asaf; Kwan, Matthew; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 53:Issue 4(2018) Page Start: 592 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Cycle packing1. Issue 4 (16th October 2014) Authors: Conlon, David; Fox, Jacob; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 45:Issue 4(2014) Page Start: 608 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. Cycle packing1. Issue 4 (6th February 2015) Authors: Conlon, David; Fox, Jacob; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 45:Issue 4(2014) Page Start: 608 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. Discrepancy of random graphs and hypergraphs. Issue 1 (8th November 2013) Authors: Ma, Jie; Naves, Humberto; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 47:Issue 1(2015) Page Start: 147 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. Finding Hamilton cycles in random graphs with few queries1. Issue 4 (27th September 2016) Authors: Ferber, Asaf; Krivelevich, Michael; Sudakov, Benny; Vieira, Pedro Journal: Random structures & algorithms Issue: Volume 49:Issue 4(2016) Page Start: 635 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. Finding paths in sparse random graphs requires many queries1. Issue 1 (29th September 2016) Authors: Ferber, Asaf; Krivelevich, Michael; Sudakov, Benny; Vieira, Pedro Journal: Random structures & algorithms Issue: Volume 50:Issue 1(2017) Page Start: 71 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. Intercalates and discrepancy in random Latin squares. Issue 2 (8th November 2017) Authors: Kwan, Matthew; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 52:Issue 2(2018) Page Start: 181 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗