Random Structures & Algorithms

Copyright © 2012 Wiley Periodicals, Inc., A Wiley Company

Cover image for Vol. 40 Issue 2

March 2012

Volume 40, Issue 2

Pages 133–267

    1. Approximate Hamilton decompositions of random graphs (pages 133–149)

      Fiachra Knox, Daniela Kühn and Deryk Osthus

      Article first published online: 11 APR 2011 | DOI: 10.1002/rsa.20365

    2. Phase transitions for random walk asymptotics on free products of groups (pages 150–181)

      Elisabetta Candellero and Lorenz A. Gilch

      Article first published online: 31 MAY 2011 | DOI: 10.1002/rsa.20370

    3. On the cut-off phenomenon for the transitivity of randomly generated subgroups (pages 182–219)

      André Galligo and Laurent Miclo

      Article first published online: 2 JUN 2011 | DOI: 10.1002/rsa.20369

    4. A percolation process on the square lattice where large finite clusters are frozen (pages 220–226)

      Jacob van den Berg, Bernardo N.B. de Lima and Pierre Nolin

      Article first published online: 28 JUN 2011 | DOI: 10.1002/rsa.20375

    5. Random coloring method in the combinatorial problem of Erdős and Lovász (pages 227–253)

      Dmitry A. Shabanov

      Article first published online: 30 MAR 2011 | DOI: 10.1002/rsa.20366

    6. A concentration result with application to subgraph count (pages 254–267)

      Guy Wolfovitz

      Article first published online: 31 MAY 2011 | DOI: 10.1002/rsa.20371

SEARCH

SEARCH BY CITATION