Local k-colorings of graphs and hypergraphs

A. Gyárfás, J. Lehel, J. Nešetřil, V. Rödl, R. H. Schelp, Z. Tuza

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

A local k-coloring of a graph is a coloring of its edges in such a way that each vertex is incident to edges of at most k different colors. We investigate the similarities and differences between usual and local k-colorings, and the results presented in the paper give a general insight to the nature of local coloring. We are mainly concerned with local variants of Ramsey-type problems, in particular, with Ramsey's theorem for hypergraphs, the existence of minimal Ramsey graphs and further questions from noncomplete Ramsey Theory.

Original languageEnglish
Pages (from-to)127-139
Number of pages13
JournalJournal of Combinatorial Theory. Series B
Volume43
Issue number2
DOIs
Publication statusPublished - 1987

Fingerprint

Coloring
Hypergraph
Colouring
Graph in graph theory
Ramsey Theory
Ramsey's Theorem
Color
Vertex of a graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Local k-colorings of graphs and hypergraphs. / Gyárfás, A.; Lehel, J.; Nešetřil, J.; Rödl, V.; Schelp, R. H.; Tuza, Z.

In: Journal of Combinatorial Theory. Series B, Vol. 43, No. 2, 1987, p. 127-139.

Research output: Contribution to journalArticle

Gyárfás, A. ; Lehel, J. ; Nešetřil, J. ; Rödl, V. ; Schelp, R. H. ; Tuza, Z. / Local k-colorings of graphs and hypergraphs. In: Journal of Combinatorial Theory. Series B. 1987 ; Vol. 43, No. 2. pp. 127-139.
@article{f7a5d3f6f22e4e6cb1b8d73be8c125a0,
title = "Local k-colorings of graphs and hypergraphs",
abstract = "A local k-coloring of a graph is a coloring of its edges in such a way that each vertex is incident to edges of at most k different colors. We investigate the similarities and differences between usual and local k-colorings, and the results presented in the paper give a general insight to the nature of local coloring. We are mainly concerned with local variants of Ramsey-type problems, in particular, with Ramsey's theorem for hypergraphs, the existence of minimal Ramsey graphs and further questions from noncomplete Ramsey Theory.",
author = "A. Gy{\'a}rf{\'a}s and J. Lehel and J. Nešetřil and V. R{\"o}dl and Schelp, {R. H.} and Z. Tuza",
year = "1987",
doi = "10.1016/0095-8956(87)90017-7",
language = "English",
volume = "43",
pages = "127--139",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Local k-colorings of graphs and hypergraphs

AU - Gyárfás, A.

AU - Lehel, J.

AU - Nešetřil, J.

AU - Rödl, V.

AU - Schelp, R. H.

AU - Tuza, Z.

PY - 1987

Y1 - 1987

N2 - A local k-coloring of a graph is a coloring of its edges in such a way that each vertex is incident to edges of at most k different colors. We investigate the similarities and differences between usual and local k-colorings, and the results presented in the paper give a general insight to the nature of local coloring. We are mainly concerned with local variants of Ramsey-type problems, in particular, with Ramsey's theorem for hypergraphs, the existence of minimal Ramsey graphs and further questions from noncomplete Ramsey Theory.

AB - A local k-coloring of a graph is a coloring of its edges in such a way that each vertex is incident to edges of at most k different colors. We investigate the similarities and differences between usual and local k-colorings, and the results presented in the paper give a general insight to the nature of local coloring. We are mainly concerned with local variants of Ramsey-type problems, in particular, with Ramsey's theorem for hypergraphs, the existence of minimal Ramsey graphs and further questions from noncomplete Ramsey Theory.

UR - http://www.scopus.com/inward/record.url?scp=0002074842&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0002074842&partnerID=8YFLogxK

U2 - 10.1016/0095-8956(87)90017-7

DO - 10.1016/0095-8956(87)90017-7

M3 - Article

AN - SCOPUS:0002074842

VL - 43

SP - 127

EP - 139

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 2

ER -