The list-chromatic number of infinite graphs

DOI10.1007/s11856-012-0145-6zbMath1275.05039OpenAlexW2129846869MaRDI QIDQ375873

Péter Komjáth

Publication date: 1 November 2013

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-012-0145-6

zbMATH Keywords

infinite graphscoloring numberlist-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63)

Related Items (7)

Cardinal invariants of closed graphs ⋮ The list-chromatic number of infinite graphs defined on Euclidean spaces ⋮ Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings ⋮ Infinitely connected subgraphs in graphs of uncountable chromatic number ⋮ The chromatic number of infinite graphs - A survey ⋮ Semialgebraic graphs having countable list-chromatic numbers ⋮ Lower bounds on coloring numbers from hardness hypotheses in pcf theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings
• The list-chromatic number of infinite graphs defined on Euclidean spaces
• Set theory. An introduction to independence proofs
• A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
• The odd-distance plane graph
• Proper Forcing
• The Colouring Number
• Iterated perfect-set forcing
• Cardinal addition and the axiom of choice
• The Law of Infinite Cardinal Addition is Weaker than the Axiom of Choice
• Fragile measurability
• On chromatic number of graphs and set-systems

This page was built for publication: The list-chromatic number of infinite graphs