Premium
Local and mean k ‐Ramsey numbers for complete graphs
Author(s) -
Schelp R. H.
Publication year - 1997
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/(sici)1097-0118(199703)24:3<201::aid-jgt1>3.0.co;2-t
Subject(s) - ramsey's theorem , combinatorics , mathematics , graph , discrete mathematics
This paper establishes that the local k ‐Ramsey number R ( K m , k — loc ) is identical with the mean k ‐Ramsey number R ( K m , k — mean ). This answers part of a question raised by Caro and Tuza. © 1997 John Wiley & Sons, Inc.