Brewster, R. C.; Cockayne, E. J.; Mynhardt, C. M.
(2009-08-20)
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 ...