Counting triangles in some Ramsey graphs

Show full item record

Title: Counting triangles in some Ramsey graphs
Author: Lin, Andrew; Mackey, John
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.
Record URI: http://hdl.handle.net/1850/8816
Date: 2009

Files in this item

Files Size Format View
ALinTechnicalReport.pdf 134.8Kb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML


Advanced Search

Browse