Irredundant Ramsey numbers for graphs
Date
2009-08-20T16:33:45Z
Authors
Brewster, R. C.
Cockayne, E. J.
Mynhardt, C.M.
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
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 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.
Description
Keywords
technical reports (mathematics and statistics)