Gábor Damásdi: Problems from distance geometry

Given n points in the plane they determine n choose 2 distances between them. But these distances are highly dependent, usually 2n-3 of them determines the rest. Distance geometry's goal in general is to gain information on which sets of distances can be realized by a set of points. Many questions fromdiscrete geometry fit into this area. (Chromatic number of the plane, Harborth conjecture, integral point sets...) I will introduce the basic questions and results from these topics and then I will present a selection of nice open problems.