Irredundant Ramsey numbers

Simple item page
dc.contributor.authorBrewster, R. C.en_US
dc.date.accessioned2024-08-13T00:06:03Z
dc.date.available2024-08-13T00:06:03Z
dc.date.copyright1988en_US
dc.date.issued1988
dc.degree.departmentDepartment of Mathematics
dc.degree.departmentDepartment of Mathematics and Statistics
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractGiven a graph G=(V, E), a set of vertices S is irredundant if for no vertex v in S is the closed neighbourhood of v contained in the union of the closed neighbourhoods of the vertices in S-{v}. The 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 vertex subset of at least n vertices or its complement G has an irredundant vertex subset 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, s(3, 5) = 12, and s(3, 6) = 15.en
dc.format.extent54 pages
dc.identifier.urihttps://hdl.handle.net/1828/17083
dc.rightsAvailable to the World Wide Weben_US
dc.subjectUN SDG 11: Sustainable Cities and Communitiesen
dc.titleIrredundant Ramsey numbersen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
BREWSTER_Richard_Charles_MSc_1988_500537.pdf
Size:
13 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
 
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.