Ramsey numbers for local colorings

A. Gyárfás, J. Lehel, R. H. Schelp, ZS Tuza

Research output: Contribution to journalArticle

37 Citations (Scopus)

Abstract

The concept of a local k-coloring of a graph G is introduced and the corresponding local k-Ramsey number rlock(G) is considered. A local k-coloring of G is a coloring of its edges in such a way that the edges incident to any vertex of G are colored with at most k colors. The number rlock(G) is the minimum m for which Km contains a monochromatic copy of G for every local k-coloring of Km. The number rlock(G) is a natural generalization of the usual Ramsey number rk(G) defined for usual k-colorings. The results reflect the relationship between rk(G) and rlock(G) for certain classes of graphs.

Original languageEnglish
Pages (from-to)267-277
Number of pages11
JournalGraphs and Combinatorics
Volume3
Issue number1
DOIs
Publication statusPublished - Dec 1 1987

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this