Article contents
Mixed Ramsey Numbers Revisited
Published online by Cambridge University Press: 03 December 2003
Abstract
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.
- Type
- Research Article
- Information
- Combinatorics, Probability and Computing , Volume 12 , Issue 5-6: This issue contains volume twelve, parts five and six , November 2003 , pp. 653 - 660
- Copyright
- Copyright © Cambridge University Press 2003
- 1
- Cited by