1. N. Alon and J. H. Spencer, The Probabilistic Method (JohnWiley & Sons, Hoboken, NJ, 2016).
2. J. Brenner and L. Cummings, “The Hadamard maximum determinant problem,” Amer. Math. Monthly 79, 626 (1972).
3. E. E. Demekhin, A. M. Raĭgorodskiĭ, and O. I. Rubanov, “Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size,” Mat. Sb. 204, 49 (2009) [Sb. Math. 204, 508 (2009)].
4. R. Fagin, “Probabilities on finite models,” J. Symbolic Logic 41, 50 (1976).
5. Yu. V. Glebskiĭ, D. I. Kogan, M. I. Liogon’kiĭ, and V. A. Talanov, “Range and degree of realizability of formulas in the restricted predicate calculus,” Kibernetika 5, 17 (1969) [Cybernetics 5, 142 (1969)].