1. Alon, N., Kahale, N.: Approximating the independence number via the φ-function. Math. Programming 80 (1998) 253–264.
2. Alon, N., Krivelevich, M., Sudakov, B.: Finding a large hidden clique in a random graph. Random Structures & Algorithms 13 (1998) 457–466
3. Alon, N., Krivelevich, M., Vu, V.H.: On the concentration of the eigenvalues of random symmetric matrices. to appear in Israel J. of Math.
4. Blum, A., Spencer, J.: Coloring random and semirandom k-colorable graphs. J. of Algorithms 19(2) (1995) 203–234
5. Bollobás, B.: Random graphs, 2nd edition. Cambridge University Press (2001)