Small subgraphs in random graphs and the power of multiple choices

RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) <i>By</i> S<scp>VANTE</scp> J<scp>ANSON</scp>, T<scp>OMASZ</scp> Ł<scp>UCZAK</scp> and A<scp>NDRZEJ</scp> R<scp>UCIŃSKI</scp>: 333 pp., US$48.50, <scp>ISBN</scp> 0-471-17541-2 (John Wiley &amp; Sons, New York, 2000). RANDOM GRAPHS (Encyclopaedia of Mathematics and its Applications 53) <i>By</i> V. F. K<scp>OLCHIN</scp>: 252 pp., US$50, <scp>ISBN</scp> 0-521-44081-5 (Cambridge University Press, 1999).

W. T. Gowers · Bulletin of the London Mathematical Society · 2001 · 323 citations

Natural Sciences, Computer Science, Mathematics +14

Threshold functions

B. Bollobás, Andrew Thomason · COMBINATORICA · 1987 · 293 citations

Threshold functions for small subgraphs

Béla Bollobás · Mathematical Proceedings of the Cambridge Philosophical Society · 1981 · 168 citations

Natural Sciences, Mathematics, Discrete Mathematics +12

Avoiding a giant component

Tom Bohman, Alan Frieze · Random Structures and Algorithms · 2001 · 109 citations

Natural Sciences, Computer Science, Mathematics +10

Birth control for giants

Joel Spencer, Nicholas Wormald · COMBINATORICA · 2007 · 107 citations

Medicine, Maternal Health, Maternal-fetal Medicine +1