Computation of the Folkman number F_e(3, 3; 5)

Show simple item record

dc.contributor.author Piwakowski, Konrad
dc.contributor.author Radziszowski, Stanislaw
dc.contributor.author Urbanski, Sebastian
dc.date.accessioned 2009-01-09T18:31:29Z
dc.date.available 2009-01-09T18:31:29Z
dc.date.issued 1999
dc.identifier.citation Journal of Graph Theory 32 (1999) 41-49
dc.identifier.uri http://hdl.handle.net/1850/7991
dc.description This article can also be found at the publisher's website at: www3.interscience.wiley.com en_US
dc.description RIT community members may access full-text via RIT Libraries licensed databases: http://library.rit.edu/databases/
dc.description.abstract With the help of computer algorithms, we improve the lower bound on the edge Folkman number F_e(3; 3; 5) and vertex Folkman number F_v(3; 3; 4), and thus show that the exact values of these numbers are 15 and 14, respectively. We also present computer enumeration of all critical graphs.
dc.language.iso en_US
dc.publisher John Wiley & Sons: Journal of Graph Theory
dc.relation.ispartofseries vol. 32
dc.relation.ispartofseries pps. 41-49
dc.title Computation of the Folkman number F_e(3, 3; 5)
dc.type Article

Files in this item

Files Size Format View
JohnWileySonsArchivePolicy.pdf 95.61Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse