Premium
Irredundant ramsey numbers for graphs
Author(s) -
Brewster R. C.,
Cockayne E. J.,
Mynhardt C. M.
Publication year - 1989
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/jgt.3190130303
Subject(s) - ramsey's theorem , combinatorics , mathematics , vertex (graph theory) , graph , complement (music) , discrete mathematics , independent set , biochemistry , chemistry , complementation , gene , phenotype
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 vertices. The existence of these numbers is guaranteed by Ramsey's theorem. We prove that s (3, 3) = 6, s (3, 4) = 8, and s (3,5) = 12.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom