Premium
Ramsey numbers for multiple copies of complete graphs
Author(s) -
Lorimer P. J.,
Segedin R. J.
Publication year - 1978
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.3190020112
Subject(s) - combinatorics , mathematics , ramsey's theorem , discrete mathematics , graph
The Ramsey numbers r ( m 1 K p , …, m c K p c) are calculated to within bounds which are independent of m 1 , …, m c when c > 2 and p 1 , …, p c > 2.