Premium
On zero sum Ramsey numbers: Multiple copies of a graph
Author(s) -
Bialostocki A.,
Dierker P.
Publication year - 1994
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.3190180205
Subject(s) - ramsey's theorem , mathematics , combinatorics , zero (linguistics) , discrete mathematics , graph , ramsey theory , philosophy , linguistics
As a consequence of our main result, a theorem of Schrijver and Seymour that determines the zero sum Ramsey numbers for the family of all r ‐hypertrees on m edges and a theorem of Bialostocki and Dierker that determines the zero sum Ramsey numbers for r ‐hypermatchings are combined into a single theorem. Another consequence is the determination of zero sum Ramsey numbers of multiple copies of some small graphs.