1. Bikov, A.: Computation and Bounding of Folkman Numbers. PhD Thesis, Sofia University “St. Kliment Ohridski” (2018). arXiv:1806.09601
2. Bikov, A., Nenov, N.: On the independence number of $$(3,3)$$-Ramsey graphs and the Folkman number $$F_e(3,3;4)$$. Australas. J. Comb. 77, 35–50 (2020)
3. Bohman, T., Keevash. P.: 3 Dynamic concentration of the triangle-free process. In: Nešetřil, J., Pellegrini, M. (eds.), The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol. 16, Edizioni della Normale, Pisa. arXiv:1302.5963 (2013) (52–75, revised version (2019))
4. Chvátal, V.: The minimality of the Mycielski graph. Graphs and Combinatorics, Proceedings of the Capital Conference, George Washington University, Washington DC, 1973. Lecture Notes in Mathematics, vol. 406, pp. 243–246. Springer, Berlin (1974)
5. Coles, J., Radziszowski, S.: Computing the Folkman Number $$F_v(2,2,3;4)$$. J. Comb. Math. Comb. Comput. 58, 13–22 (2006)