Abstract
We extend Goodman’s result on the cardinality of monochromatic triangles in a 2-colored complete graph to the case of bounding the number of triangles in the first color. We apply it to derive the upper bounds on some non-diagonal Ramsey numbers. In particular we show that R(K4 − e,K8) <= 45.
Publication Date
2009
Document Type
Technical Report
Department, Program, or Center
Computer Science (GCCIS)
Recommended Citation
Lin, Andrew and Mackey, John, "Counting triangles in some Ramsey graphs" (2009). Accessed from
https://repository.rit.edu/article/983
Campus
RIT – Main Campus
COinS
Comments
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.