Using several computer algorithms we calculate some values and bounds for the function e(3, k, n), the minimum number of edges in a triangle-free graphs on n vertices with no independent set of size k. As a consequence, the following new upper bounds for the classical two color Ramsey numbers are obtained: R(3,10)<=43, R(3,11)<=51, R(3,12)<=60, R(3,13)<=69 and R(3,14)<=78.
Department, Program, or Center
Center for Advancing the Study of CyberInfrastructure
The Journal of Combinatorial Mathematics and Combinatorial Computing 4 (1988) 207 - 212
RIT – Main Campus