On zero sum Ramsey numbers: Multiple copies of a graph
Authors:
- 1 March 1994
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 18 (2) , 143-151
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On zero-treesJournal of Graph Theory, 1992
- A simpler proof and a generalization of the zero-trees theoremJournal of Combinatorial Theory, Series A, 1991
- On ramsey numbers for large disjoint unions of graphsDiscrete Mathematics, 1988
- Ramsey numbers for unions of some cyclesDiscrete Mathematics, 1988
- On the Ramsey numbers r(G, nH) and r(nG, nH) when n is largeDiscrete Mathematics, 1987
- Edge-colored complete graphs with precisely colored subgraphsCombinatorica, 1983
- Ramsey theorems for multiple copies of graphsTransactions of the American Mathematical Society, 1975