Computation of the Ramsey number R(W5,K5)

Show simple item record

dc.contributor.author Radziszowski, Stanislaw
dc.contributor.author Stinehour, Josh
dc.contributor.author Tse, Kung-Kuen
dc.date.accessioned 2009-05-29T14:44:22Z
dc.date.available 2009-05-29T14:44:22Z
dc.date.issued 2006
dc.identifier.citation Bulletin of the Institute of Combinatorics and Its Applications, 47 (2006) 53-57
dc.identifier.uri http://hdl.handle.net/1850/9694
dc.description.abstract We determine the value of the Ramsey number R(W5;K5) to be 27, where W5 = K1 + C4 is the 4-spoked wheel of order 5. This solves one of the four remaining open cases in the tables given in 1989 by George R. T. Hendry, which included the Ramsey numbers R(G;H) for all pairs of graphs G and H having ve vertices, except seven entries. In addition, we show that there exists a unique up to isomorphism critical Ramsey graph for W5 versus K5. Our results are based on computer algorithms.
dc.language.iso en_US
dc.publisher Institute of Combinatorics and Its Applications
dc.relation.ispartofseries vol. 47
dc.subject Ramsey numbers en_US
dc.subject Graph algorithms en_US
dc.title Computation of the Ramsey number R(W5,K5)
dc.type Article

Files in this item

Files Size Format View
SRadziszowskiArticle2006.pdf 68.96Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse