1. N. Alon and E. Berger, The Grothendieck constant of random and pseudo-random graphs, Discrete Optim., 5 (2008), no. 2, 323–327.
2. N. Alon, K. Makarychev, Y. Makarychev and A. Naor, Quadratic forms on graphs, Invent Math., 163 (2006), no. 3, 499–522.
3. S. C. Cater, F. Harary and R. W. Robinson, One-color triangle avoidance games, Proceedings of the Thirty-second Southeastern International Conference on Combinatorics, Graph Theory and Computing (Baton Rouge, LA, 2001), vol. 153, 2001, pp. 211–221.
4. K. Chandrasekaran, N. Goyal and B. Haeupler, Determininistic algorithms for the Lovász Local Lemma, in: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithm (SODA 2010).
5. V. Chvátal and L. Lovász, Every directed graph has a semi-kernel, Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ.,Columbus, Ohio, 1972; dedicated to Arnold Ross), Springer, Berlin, 1974, pp. 175. Lecture Notes in Math., Vol. 411.