Ramsey numbers for local colorings |
| |
Authors: | A Gyárfás J Lehel R H Schelp ZS Tuza |
| |
Institution: | (1) Computer and Automation Institute, Hungarian Academy of Sciences, Kende u. 13-17, 1111 Budapest, Hungary;(2) Memphis State University, 38152 Memphis, TN, USA |
| |
Abstract: | The concept of a localk-coloring of a graphG is introduced and the corresponding localk-Ramsey numberr
loc
k
(G) is considered. A localk-coloring ofG is a coloring of its edges in such a way that the edges incident to any vertex ofG are colored with at mostk colors. The numberr
loc
k
(G) is the minimumm for whichK
m
contains a monochromatic copy ofG for every localk-coloring ofK
m
. The numberr
loc
k
(G) is a natural generalization of the usual Ramsey numberr
k
(G) defined for usualk-colorings. The results reflect the relationship betweenr
k
(G) andr
loc
k
(G) for certain classes of graphs.This research was done while under an IREX grant. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|