Mixed Ramsey Numbers Revisited
Keyword(s):
Given a graph Hwith no isolates, the (generalized) mixed Ramsey number is the smallest integer r such that every H-free graph of order r contains an m-element irredundant set. We consider some questions concerning the asymptotic behaviour of this number (i) with H fixed and , (ii) with m fixed and a sequence of dense graphs, in particular for the sequence . Open problems are mentioned throughout the paper.
Keyword(s):
Keyword(s):
Keyword(s):
2009 ◽
Vol 18
(1-2)
◽
pp. 247-258
◽
Keyword(s):