אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

If D is a countable set of positive reals, let X_n(D) be the following graph: the vertices are the points of the n-dimensional Euclidean space, two points joined if their distance is in D. We determine the list-chromatic number of these graphs as much as possible