621. The Kőnig graph process. Issue 4 (9th October 2020) Authors: Kamčev, Nina; Krivelevich, Michael; Morrison, Natasha; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 57:Issue 4(2020) Page Start: 1272 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
622. The largest hole in sparse random graphs. Issue 4 (25th February 2022) Authors: Draganić, Nemanja; Glock, Stefan; Krivelevich, Michael Journal: Random structures & algorithms Issue: Volume 61:Issue 4(2022) Page Start: 666 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
623. The looping constant of ℤd. Issue 1 (13th February 2013) Authors: Levine, Lionel; Peres, Yuval Journal: Random structures & algorithms Issue: Volume 45:Issue 1(2014) Page Start: 1 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
624. The lower tail: Poisson approximation revisited1. Issue 2 (25th July 2015) Authors: Janson, Svante; Warnke, Lutz Journal: Random structures & algorithms Issue: Volume 48:Issue 2(2016) Page Start: 219 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
625. The Marčenko‐Pastur law for sparse random bipartite biregular graphs1. Issue 2 (23rd December 2014) Authors: Dumitriu, Ioana; Johnson, Tobias Journal: Random structures & algorithms Issue: Volume 48:Issue 2(2016) Page Start: 313 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
626. 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) ↗
627. The Moran forest. Issue 2 (15th February 2021) Authors: Bienvenu, François; Duchamps, Jean‐Jil; Foutel‐Rodier, Félix Journal: Random structures & algorithms Issue: Volume 59:Issue 2(2021) Page Start: 155 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
628. The number of bounded‐degree spanning trees. Issue 3 (27th August 2022) Authors: Yuster, Raphael Journal: Random structures & algorithms Issue: Volume 62:Issue 3(2023) Page Start: 737 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
629. The number of graphs and a random graph with a given degree sequence. Issue 3 (29th February 2012) Authors: Barvinok, Alexander; Hartigan, J.A. Journal: Random structures & algorithms Issue: Volume 42:Issue 3(2013) Page Start: 301 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
630. The number of satisfying assignments of random 2‐SAT formulas. Issue 4 (17th January 2021) Authors: Achlioptas, Dimitris; Coja‐Oghlan, Amin; Hahn‐Klimroth, Max; Lee, Joon; Müller, Noëla; Penschuck, Manuel; Zhou, Guangyan Journal: Random structures & algorithms Issue: Volume 58:Issue 4(2021) Page Start: 609 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗