THE IRREDUNDANT RAMSEY NUMBER S(3,7)

Authors
CHEN G ROUSSEAU CC
Citation
G. Chen et Cc. Rousseau, THE IRREDUNDANT RAMSEY NUMBER S(3,7), Journal of graph theory, 19(2), 1995, pp. 263-270
Citations number
4
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Journal of graph theory → ACNP
ISSN journal
03649024
Volume
19
Issue
2
Year of publication
1995
Pages
263 - 270
Database
ISI
SICI code
0364-9024(1995)19:2<263:TIRNS>2.0.ZU;2-S
Abstract
The irredundant Ramsey number s(m,n) is the smallest p such that for e very graph G with p vertices, either G contains an n-element irredunda nt set or its complement ($) over bar G contains an m-element irredund ant set. Cockayne, Hattingh, and Mynhardt have given a computer-assist ed proof that s(3,7) = 18. The purpose of this paper is to give a self -contained proof of this result. (C) 1995 John Wiley & Sons, Inc.