The irredundant Ramsey number s(m, n) is the smallest N such that in every red-blue colouring of the edges of KN, either the blue graph contains an m-element irredundant set or the red graph contains an n-element irredundant set. We prove an asymptotic lower bound for s(m, n). 1991 Mathematics Subject Classification. 05C55.
ASJC Scopus subject areas
- Mathematics (miscellaneous)