Distances Realized by Sets Covering the Plane
暂无分享,去创建一个
Abstract A proof is given of the (known) result that, if real n-dimensional Euclidean space Rn is covered by any n + 1 sets, then at least one of these sets is such that each distance d(0
[1] D. E. Raiskii. Realization of all distances in a decomposition of the space Rn into n+1 parts , 1970 .
[2] V. Klee,et al. Combinatorial Geometry in the Plane , 1964 .
[3] W. T. Tutte,et al. ON THE DIMENSION OF A GRAPH , 1965 .
[4] D. G. Larman. On the Realization of Distances within Decompositions of Sets in Rn , 1967 .
[5] Paul Erdös,et al. A colour problem for infinite graphs and a problem in the theory of relations , 1951 .