Brewster, R. C.2024-08-132024-08-1319881988https://hdl.handle.net/1828/17083Given 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.54 pagesAvailable to the World Wide WebUN SDG 11: Sustainable Cities and CommunitiesThesis