Local and Mean Ramsey Numbers for Trees

  title={Local and Mean Ramsey Numbers for Trees},
  author={B{\'e}la Bollob{\'a}s and Alexandr V. Kostochka and Richard H. Schelp},
  journal={J. Comb. Theory, Ser. B},
The usual Ramsey number R(G, k) is the smallest positive integer n such that any coloring of the edges of Kn by at most k colors contains a monochromatic copy of G. Over the past years several papers have been written in which the number of different colors used has no longer been restricted to k, but a restriction is placed on the number of colored edges incident to the vertices. To be precise, let H be a fixed graph of order n and let f be a coloring on the edges of H. For each v # V(H… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-5 of 5 extracted citations


Publications referenced by this paper.
Showing 1-7 of 7 references

Local and mean k-Ramsey numbers for complete graphs

Journal of Graph Theory • 1997
View 2 Excerpts

On k-local and k-mean colorings of graphs and hypergraphs

Y. Caro, Zs. Tuza
Quart. J. Math. Oxford (2) • 1993
View 1 Excerpt

On klocal and kmean colorings of graphs and hypergraphs , Quart

Zs. Tuza
. J . Math . Oxford • 1993

The Erdo s So s conjecture for graphs of girth 5, in ``Selected

S. Brandt, E. Dobson
Papers in Honour of Paul Erdo s on the Occasion of His 80th Birthday (Keszthely, • 1993
View 1 Excerpt

On several variations of the turan and ramsey numbers

Journal of Graph Theory • 1992
View 1 Excerpt

Decompositions of complete graphs into subgraphs isomorphic to a given graph, in ``Proceedings of the 5th British Combinatorial Conference'' (C

R. M. Wilson
Congr. Numer • 1975
View 2 Excerpts

Similar Papers

Loading similar papers…