Irredundant Ramsey numbers for graphs

Simple item page
dc.contributor.authorBrewster, R. C.
dc.contributor.authorCockayne, E. J.
dc.contributor.authorMynhardt, C.M.
dc.date.accessioned2009-08-20T16:33:45Z
dc.date.available2009-08-20T16:33:45Z
dc.date.copyright1988en
dc.date.issued2009-08-20T16:33:45Z
dc.description.abstractThe irredundant Ramsey Number s(m,n) is the least value of p such that for any p-vertex graph G, either G has an irredundant set of at least n vertices or its complement G^- has an irredundant set of at least m vertices. The existence of these numbers is guaranteed by Ramsey's theorem. We prove that s(3,3)=6, s(3,4)=8 and s(3,5)=12.en
dc.description.sponsorshipCanadian Natural Sciences and Engineering Research Councilen
dc.identifier.urihttp://hdl.handle.net/1828/1546
dc.language.isoenen
dc.relation.ispartofseriesDM-457-IRen
dc.subjecttechnical reports (mathematics and statistics)
dc.subject.departmentDepartment of Mathematics and Statistics
dc.titleIrredundant Ramsey numbers for graphsen
dc.typeTechnical Reporten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
DM-457-IR.pdf
Size:
399.45 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.84 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Faculty and Staff Publications
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.