Random Structures & Algorithms

Cover image for Vol. 37 Issue 4

December 2010

Volume 37, Issue 4

Pages 407–539

    1. Ramsey properties of random discrete structures (pages 407–436)

      Ehud Friedgut, Vojtěch Rödl and Mathias Schacht

      Article first published online: 25 OCT 2010 | DOI: 10.1002/rsa.20352

    2. Explicit sparse almost-universal graphs for equation image (pages 437–454)

      Michael Capalbo

      Article first published online: 25 OCT 2010 | DOI: 10.1002/rsa.20337

    3. Generalization of a theorem of Erdős and Rényi on Sidon sequences (pages 455–464)

      Javier Cilleruelo, Sándor Z. Kiss, Imre Z. Ruzsa and Carlos Vinuesa

      Article first published online: 25 OCT 2010 | DOI: 10.1002/rsa.20350

    4. Large deviations and moments for the Euler characteristic of a random surface (pages 465–476)

      Kevin Fleming and Nicholas Pippenger

      Article first published online: 25 OCT 2010 | DOI: 10.1002/rsa.20331

    5. Weighted random popular matchings (pages 477–494)

      Toshiya Itoh and Osamu Watanabe

      Article first published online: 25 OCT 2010 | DOI: 10.1002/rsa.20316

    6. Braess's Paradox in large random graphs (pages 495–515)

      Gregory Valiant and Tim Roughgarden

      Article first published online: 25 OCT 2010 | DOI: 10.1002/rsa.20325

    7. Chasing robbers on random graphs: Zigzag theorem (pages 516–524)

      Tomasz Łuczak and Paweł Prałat

      Article first published online: 25 OCT 2010 | DOI: 10.1002/rsa.20338

    8. A sharp inverse Littlewood-Offord theorem (pages 525–539)

      Terence Tao and Van Vu

      Article first published online: 25 OCT 2010 | DOI: 10.1002/rsa.20327

SEARCH

SEARCH BY CITATION