30 <= R(3,3,4) <= 31

Show simple item record

dc.contributor.author Piwakowski, Konrad
dc.contributor.author Radziszowski, Stanislaw
dc.date.accessioned 2009-01-13T18:22:59Z
dc.date.available 2009-01-13T18:22:59Z
dc.date.issued 1998
dc.identifier.citation The Journal of Combinatorial Mathematics and Combinatorial Computing 27 (1998) 135-141
dc.identifier.issn 0835-3026
dc.identifier.uri http://hdl.handle.net/1850/8003
dc.description.abstract With the help of computer algorithms, we improve the upper bound on the classical three color Ramsey number R(3,3,4), and thus we show that the exact value of this number is 30 or 31. We also present computer enumeration of all 3-colorings of edges on at least 14 vertices without monochromatic triangles.
dc.language.iso en_US
dc.publisher The Charles Babbage Research Centre: The Journal of Combinatorial Mathematics and Combinatorial Computing
dc.relation.ispartofseries vol. 27
dc.relation.ispartofseries pps. 135-141
dc.title 30 <= R(3,3,4) <= 31
dc.type Article

Files in this item

Files Size Format View
SRadziszowskiArticle1998.pdf 135.4Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse