Recent developments in combinatorial geometry

From MaRDI portal





This survey article is devoted to selected topics of current interest in `Erdős-type' combinatorial geometry. It reports on the following problems: (a) the distribution of distances between points from a finite set in Euclidean \(d\)-dimensional space (estimates on the minimum number of distinct distances and on how often the same distance (the unit distance) -- or the minimum or the maximum distance -- may occur, and variations of these problems); (b) the number of lines meeting precisely two points of a finite set (Sylvester-Gallai problem); (c) several related concepts of dimension for graphs, namely, the minimum dimension which allows an embedding such that vertices joined by an edge satisfy some distance condition e.g., two vertices are joined by an edge only if -- or if and only if -- their distance equals 1 (or is less, or greater, than 1); (d) estimates on the maximum number of edges in geometric graphs (i.e., embeddings of graphs in the plane with straight-line edges) which avoid certain configurations, e.g., a certain number of pairwise disjoint edges; (e) estimates on the number of different \(k\)-element sets which can be separated from a point set by a hyperplane, and related questions; (f) some results on arrangements of lines in 3-space connected with realizations of weavings. For the entire collection see [Zbl 0773.00009].











This page was built for publication: Recent developments in combinatorial geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138754)