Upper bounds for some Ramsey numbers R(3, k)

Show full item record

Title: Upper bounds for some Ramsey numbers R(3, k)
Author: Radziszowski, Stanislaw; Kreher, Donald
Abstract: Using several computer algorithms we calculate some values and bounds for the function e(3, k, n), the minimum number of edges in a triangle-free graphs on n vertices with no independent set of size k. As a consequence, the following new upper bounds for the classical two color Ramsey numbers are obtained: R(3,10)<=43, R(3,11)<=51, R(3,12)<=60, R(3,13)<=69 and R(3,14)<=78.
Record URI: http://hdl.handle.net/1850/8726
Date: 1998

Files in this item

Files Size Format View
SRadziszowskiArticle1988.pdf 611.9Kb 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