Abstract

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.

Publication Date

1999

Comments

This article can also be found at the publisher's website at: www3.interscience.wiley.comNote: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.

Document Type

Article

Department, Program, or Center

Center for Advancing the Study of CyberInfrastructure

Campus

RIT – Main Campus

Share

COinS