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.
Department, Program, or Center
Computer Science (GCCIS)
Lin, Andrew and Mackey, John, "Counting triangles in some Ramsey graphs" (2009). Accessed from
RIT – Main Campus