Abstract
With the help of computer algorithms, we improve the lower bound on the Ramsey multiplicity of K4, and thus show that the exact value of it is equal to 9.
Publication Date
2001
Document Type
Article
Department, Program, or Center
Center for Advancing the Study of CyberInfrastructure
Recommended Citation
Ars Combinatoria LX (2001) 131-136
Campus
RIT – Main Campus
COinS
Comments
This article was previously published in the Proceedings of the Workshop on Computational Graph Theory and Combinatorics.Held in Victoria, British Columbia: 6-8 May 1999. ISSN:0381-7032 Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.