Random Structures & Algorithms

Cover image for Random Structures & Algorithms

September 2001

Volume 19, Issue 2

Pages 87–147

    1. On the chromatic number of set systems (pages 87–98)

      Alexandr Kostochka, Dhruv Mubayi, Vojtěch Rödl and Prasad Tetali

      Article first published online: 17 AUG 2001 | DOI: 10.1002/rsa.1020

    2. Cube Ramsey numbers are polynomial (pages 99–101)

      Shi Lingsheng

      Article first published online: 17 AUG 2001 | DOI: 10.1002/rsa.1021

    3. The diameter of long-range percolation clusters on finite cycles (pages 102–111)

      Itai Benjamini and Noam Berger

      Article first published online: 17 AUG 2001 | DOI: 10.1002/rsa.1022

    4. Martingales and large deviations for binary search trees (pages 112–127)

      Jean Jabbour-Hattab

      Article first published online: 17 AUG 2001 | DOI: 10.1002/rsa.1023

    5. Hamilton cycles containing randomly selected edges in random regular graphs (pages 128–147)

      R.W. Robinson and N.C. Wormald

      Article first published online: 17 AUG 2001 | DOI: 10.1002/rsa.1024

SEARCH

SEARCH BY CITATION