Premium
CO‐irredundant Ramsey numbers for graphs
Author(s) -
Cockayne E. J.,
MacGillivray G.,
Simmons J.
Publication year - 2000
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/1097-0118(200008)34:4<258::aid-jgt2>3.0.co;2-4
Subject(s) - ramsey's theorem , combinatorics , mathematics , graph , discrete mathematics
The study of the CO‐irredundant Ramsey numbers t ( n 1 , ···, n k ) is initiated. It is shown that several values and bounds for these numbers may be obtained from the well‐studied generalized graph Ramsey numbers and the values of t (4, 5), t (4, 6) and t (3, 3, m ) are calculated. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 258–268, 2000