The list-chromatic number of infinite graphs defined on Euclidean spaces

DOI10.1007/s00454-009-9228-5zbMath1214.05028OpenAlexW2076766732MaRDI QIDQ633199

Péter Komjáth

Publication date: 31 March 2011

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-009-9228-5

zbMATH Keywords

Euclidean spacecoloring numberlist-chromatic numbergraphs defined by distancesindependence proofs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (5)

Cardinal invariants of closed graphs ⋮ The list-chromatic number of infinite graphs ⋮ Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings ⋮ Semialgebraic graphs having countable list-chromatic numbers ⋮ GRAPHS ON EUCLIDEAN SPACES DEFINED USING TRANSCENDENTAL DISTANCES

Cites Work

• The list-chromatic number of infinite graphs
• Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)
• The odd-distance plane graph
• Problems and theorems in classical set theory
• A Decomposition Theorem for R n
• On chromatic number of graphs and set-systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The list-chromatic number of infinite graphs defined on Euclidean spaces