With the help of computer algorithms, we improve the lower bound on the edge Folkman number F_e(3; 3; 5) and vertex Folkman number F_v(3; 3; 4), and thus show that the exact values of these numbers are 15 and 14, respectively. We also present computer enumeration of all critical graphs.
Department, Program, or Center
Center for Advancing the Study of CyberInfrastructure
Journal of Graph Theory 32 (1999) 41-49
RIT – Main Campus