1. Connectivity of inhomogeneous random graphs1. Issue 3 (26th February 2013) Authors: Devroye, Luc; Fraiman, Nicolas Journal: Random structures & algorithms Issue: Volume 45:Issue 3(2014) Page Start: 408 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. For most graphs H, most H‐free graphs have a linear homogeneous set1. Issue 3 (18th March 2013) Authors: Kang, Ross J.; McDiarmid, Colin; Reed, Bruce; Scott, Alex Journal: Random structures & algorithms Issue: Volume 45:Issue 3(2014) Page Start: 343 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. On a greedy 2‐matching algorithm and Hamilton cycles in random graphs with minimum degree at least three1. Issue 3 (27th December 2012) Authors: Frieze, Alan Journal: Random structures & algorithms Issue: Volume 45:Issue 3(2014) Page Start: 443 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. On the concentration of the number of solutions of random satisfiability formulas. Issue 3 (12th April 2013) Authors: Abbe, Emmanuel; Montanari, Andrea Journal: Random structures & algorithms Issue: Volume 45:Issue 3(2014) Page Start: 362 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Sets that are connected in two random graphs. Issue 3 (13th March 2013) Authors: Molloy, Michael Journal: Random structures & algorithms Issue: Volume 45:Issue 3(2014) Page Start: 498 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. Stochastic service systems, random interval graphs and search algorithms1. Issue 3 (26th February 2013) Authors: Eschenfeldt, Patrick; Gross, Ben; Pippenger, Nicholas Journal: Random structures & algorithms Issue: Volume 45:Issue 3(2014) Page Start: 421 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. The diamond‐free process. Issue 3 (11th October 2013) Authors: Picollelli, Michael E. Journal: Random structures & algorithms Issue: Volume 45:Issue 3(2014) Page Start: 513 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. The mixing time of the giant component of a random graph1. Issue 3 (14th May 2014) Authors: Benjamini, Itai; Kozma, Gady; Wormald, Nicholas Journal: Random structures & algorithms Issue: Volume 45:Issue 3(2014) Page Start: 383 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗