The List-Chromatic Number of Infinite Graphs Defined on Euclidean Spaces

If D is a countable set of positive reals, 2≤ n < ω , let X n ( D ) be the graph with the points of R n as vertices where two vertices are joined iff their distance is in D . We determine the list-chromatic number of X n ( D ) as much as possible.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete & computational geometry 2011-04, Vol.45 (3), p.497-502
1. Verfasser:	Komjath, Peter
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Computational geometry Computational Mathematics and Numerical Analysis Euclidean space Graphs Mathematics Mathematics and Statistics Theorems
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	If D is a countable set of positive reals, 2≤ n < ω , let X n ( D ) be the graph with the points of R n as vertices where two vertices are joined iff their distance is in D . We determine the list-chromatic number of X n ( D ) as much as possible.
ISSN:	0179-5376 1432-0444
DOI:	10.1007/s00454-009-9228-5