Coloring graphs with locally few colors
type: Item
instance of: scholarly article
title: Coloring graphs with locally few colors
zbMATH Open document ID: 0591.05030
DOI: 10.1016/0012-365X(86)90065-8
author: Péter Komjáth
author: Vojtěch Rödl
author: Zoltán Füredi
author: Andras Hajnal
author: Ákos Seress
author: P. Erdős
published in: Discrete Mathematics
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 3948300
zbMATH Keywords: strong limit cardinal
zbMATH Keywords: intersecting Sperner family
zbMATH Keywords: local r-colorings
zbMATH Keywords: chromatic number
zbMATH Keywords: infinite graphs
Wikidata QID: Q105741804
MaRDI profile type: Publication
cites work: Graph Theory and Probability
cites work: On chromatic number of graphs and set-systems
cites work: Q5548831
cites work: Enumeration of intersecting families
cites work: Q5512796
cites work: Families of \(k\)-independent sets
full work available at URL: 0012-365x(86)90065-8
OpenAlex ID: W2099554026
description: scientific article; zbMATH DE number 3948300