Brewster, R. C.Cockayne, E. J.Mynhardt, C.M.2009-08-202009-08-2019882009-08-20http://hdl.handle.net/1828/1546The 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.entechnical reports (mathematics and statistics)Technical ReportDepartment of Mathematics and Statistics