1. A Ramsey property of random regular and k‐out graphs. Issue 3 (5th August 2019) Authors: Anastos, Michael; Bal, Deepak Journal: Journal of graph theory Issue: Volume 93:Issue 3(2020) Page Start: 363 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. A scaling limit for the length of the longest cycle in a sparse random digraph. Issue 1 (14th June 2021) Authors: Anastos, Michael; Frieze, Alan Journal: Random structures & algorithms Issue: Volume 60:Issue 1(2022) Page Start: 3 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Finding maximum matchings in random regular graphs in linear expected time. Issue 3 (24th November 2020) Authors: Anastos, Michael; Frieze, Alan Journal: Random structures & algorithms Issue: Volume 58:Issue 3(2021) Page Start: 390 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis. Issue 4 (16th October 2020) Authors: Anastos, Michael; Frieze, Alan Journal: Random structures & algorithms Issue: Volume 57:Issue 4(2020) Page Start: 865 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected?. Issue 4 (30th April 2019) Authors: Anastos, Michael; Frieze, Alan Journal: Journal of graph theory Issue: Volume 92:Issue 4(2019) Page Start: 405 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. On the connectivity of proper colorings of random graphs and hypergraphs. Issue 4 (8th February 2020) Authors: Anastos, Michael; Frieze, Alan Journal: Random structures & algorithms Issue: Volume 56:Issue 4(2020) Page Start: 988 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗