The list-chromatic number of infinite graphs
type: Item
instance of: scholarly article
title: The list-chromatic number of infinite graphs
zbMATH Open document ID: 1275.05039
author: Péter Komjáth
published in: Israel Journal of Mathematics
publication date: 2013-11-01T00:00:00Z
Mathematics Subject Classification ID: 05C63
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6221767
zbMATH Keywords: coloring number
zbMATH Keywords: list-chromatic number
zbMATH Keywords: infinite graphs
MaRDI profile type: Publication
full work available at URL: s11856-012-0145-6
OpenAlex ID: W2129846869
cites work: Proper Forcing
cites work: Q3142409
cites work: The odd-distance plane graph
cites work: Iterated perfect-set forcing
cites work: On chromatic number of graphs and set-systems
cites work: Q3344197
cites work: Cardinal addition and the axiom of choice
cites work: The Law of Infinite Cardinal Addition is Weaker than the Axiom of Choice
cites work: Fragile measurability
cites work: Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings
cites work: The Colouring Number
cites work: The list-chromatic number of infinite graphs defined on Euclidean spaces
cites work: Set theory. An introduction to independence proofs
cites work: Q4873221
cites work: A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
cites work: Q4375363
DOI: 10.1007/S11856-012-0145-6
description: scientific article; zbMATH DE number 6221767