Random Structures & Algorithms

Cover image for Vol. 43 Issue 2

September 2013

Volume 43, Issue 2

Pages 131–263

    1. The phase transition in random graphs: A simple proof (pages 131–138)

      Michael Krivelevich and Benny Sudakov

      Version of Record online: 24 SEP 2012 | DOI: 10.1002/rsa.20470

    2. Randomly coloring constant degree graphs (pages 181–200)

      Martin Dyer, Alan Frieze, Thomas P. Hayes and Eric Vigoda

      Version of Record online: 3 AUG 2012 | DOI: 10.1002/rsa.20451

    3. Rumor spreading on random regular graphs and expanders (pages 201–220)

      Nikolaos Fountoulakis and Konstantinos Panagiotou

      Version of Record online: 28 MAY 2012 | DOI: 10.1002/rsa.20432

    4. The Bohman-Frieze process near criticality (pages 221–250)

      Mihyun Kang, Will Perkins and Joel Spencer

      Version of Record online: 28 MAY 2012 | DOI: 10.1002/rsa.20437

      Corrected by:

      Erratum: Erratum to “The Bohman-Frieze process near criticality”

      Vol. 46, Issue 4, 801, Version of Record online: 30 MAR 2015

    5. Delaying satisfiability for random 2SAT (pages 251–263)

      Alistair Sinclair and Dan Vilenchik

      Version of Record online: 24 SEP 2012 | DOI: 10.1002/rsa.20465

SEARCH

SEARCH BY CITATION