W. Aiello, F. Chung, and L. Lu. Random evolution in massive graphs. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, 2001, pages 510–519.
 N. Alon and J. Spencer. The Probabilistic Method, third edition. John Wiley, Hoboken, NJ, 2008.
 N. Alon, J.-H. Kim, and J. Spencer. Nearly perfect matchings in regular simple hypergraphs. Isr. J. Math., 100:171–187, 1997.
 M. Bellare and J. Rompel. Randomness-efficient oblivious sampling. In Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, FOCS. IEEE, Santa Fe, NM, 1994, pages 276–287.
 D. Blackwell. An analog of the minimax theorem for vector payoffs. Pac. J. Math., 6:1–8, 1956.
 S. G. Bobkov and F. Götze. Exponential ...