The Probabilistic Method, Second Edition

850 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

MaxCut in ${\bm H)$-Free Graphs (2005, background): “It is known that in this case the graph has some strong pseudo-random properties; see, e.g., [8], Chapter 9.2 or [18] and their references.”
Spectral techniques applied to sparse random graphs (2005, background): “Case 2: We will use the following bound which bounds the probability that the sum of independent indicator variables deviate from their expectation (see for example [3] Appendix A): Pr[e(A,B) > kμ] < e−(k lnk)μ/3 (8)”