Ramsey numbers for local colorings
type: Item
instance of: scholarly article
title: Ramsey numbers for local colorings
zbMATH Open document ID: 0621.05023
DOI: 10.1007/BF01788549
author: B. George
published in: Graphs and Combinatorics
publication date: 1987-01-01T00:00:00Z
review text: A coloring of the edges of a graph is a local k-coloring if no more than k colors are used in coloring the edges containing any vertex. The local k-Ramsey number of a graph G, \(r^ k_{loc}(G)\), is the minimum integer M so that given any local k-coloring of the complete graph on M vertices then there exists a monochromatic copy of G. The authors prove that \(r^ k_{loc}(G)\) is always well defined, compute the exact value of \(r^ k_{loc}(G)\) for several special graphs G, and prove several relationships between the local Ramsey numbers and the Ramsey numbers as they are usually defined.
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 4006298
zbMATH Keywords: local Ramsey numbers
reviewed by: Jack E. Graver
MaRDI profile type: Publication
cites work: Q4100120
cites work: Ramsey Theorems for Multiple Copies of Graphs
cites work: Q4044600
cites work: On a Ramsey-type problem
cites work: The Ramsey number for stripes
cites work: All Ramsey numbers for cycles in graphs
cites work: Combinatorial Relations and Chromatic Graphs
cites work: Generalised Ramsey numbers for small graphs
cites work: On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
description: scientific article; zbMATH DE number 4006298