Random Structures & Algorithms

Cover image for Vol. 38 Issue 1‐2

Special Issue: Proceedings of the Fourteenth International Conference “Random Structures and Algorithms” held August 3–7, 2009 Poznañ, Poland

January - March 2011

Volume 38, Issue 1-2

Pages 1–234

    1. Ramsey games with giants (pages 1–32)

      Tom Bohman, Alan Frieze, Michael Krivelevich, Po-Shen Loh and Benny Sudakov

      Article first published online: 21 OCT 2010 | DOI: 10.1002/rsa.20343

    2. On covering by translates of a set (pages 33–67)

      Béla Bollobás, Svante Janson and Oliver Riordan

      Article first published online: 21 OCT 2010 | DOI: 10.1002/rsa.20346

    3. Dependent random choice (pages 68–99)

      Jacob Fox and Benny Sudakov

      Article first published online: 5 NOV 2010 | DOI: 10.1002/rsa.20344

    4. Excluding induced subgraphs: Critical graphs (pages 100–120)

      József Balogh and Jane Butterfield

      Article first published online: 15 NOV 2010 | DOI: 10.1002/rsa.20353

    5. Local resilience of almost spanning trees in random graphs (pages 121–139)

      József Balogh, Béla Csaba and Wojciech Samotij

      Article first published online: 29 SEP 2010 | DOI: 10.1002/rsa.20345

    6. Nonrepetitive list colourings of paths (pages 162–173)

      Jarosław Grytczuk, Jakub Przybyło and Xuding Zhu

      Article first published online: 29 SEP 2010 | DOI: 10.1002/rsa.20347

    7. Random unlabelled graphs containing few disjoint cycles (pages 174–204)

      Mihyun Kang and Colin McDiarmid

      Article first published online: 24 NOV 2010 | DOI: 10.1002/rsa.20355

    8. Equivalence of a random intersection graph and G(n,p) (pages 205–234)

      Katarzyna Rybarczyk

      Article first published online: 24 NOV 2010 | DOI: 10.1002/rsa.20356

SEARCH

SEARCH BY CITATION