✦ LIBER ✦

Distinct Distances in Homogeneous Sets in Euclidean Space

✍ Scribed by Jozsef Solymosi; Csaba D. Toth

Publisher: Springer
Year: 2006
Tongue: English
Weight: 230 KB
Volume: 35
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-006-1232-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distinct distance sets in a graph

✍ Richard A. Gibbs; Peter J. Slater 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 987 KB

The problem of labelling the complete graph K,, as near to graceful as possible is equivalent to the 'Golomb ruler problem' of finding as short a ruler as possible with n integer marks such that the distances between pairs of marks are all distinct. We generalize this to an association between label

Distinct distances determined by subsets

Distinct distances determined by subsets of a point set in space

✍ David Avis; Paul Erdo&#x030B;s; János Pach 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 670 KB

Unit Distances and Diameters in Euclidea

Unit Distances and Diameters in Euclidean Spaces

✍ Konrad J. Swanepoel 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 519 KB

Rectification of sets in Euclidean space

Rectification of sets in Euclidean spaces

✍ Alexander A. Zykov 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 450 KB

An Upper Bound for the Cardinality of an

An Upper Bound for the Cardinality of ans-Distance Set in Euclidean Space

✍ Etsuko Bannai; Kazuki Kawasaki; Yusuke Nitamizu; Teppei Sato 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 259 KB

On distinct distance sets in a graph

✍ Xiaohui Lin; Minghua Zhu; Zhengguo Yu; Chengxue Zhang; Yuansheng Yang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 182 KB

A distinct distance set (DD set) for a graph G is a vertex subset of G with the property that for ISI = s, we have (~) distinct distances of the pairs of vertices in S. In this article, it is shown that (a) For 6 ~< k ~< 18 there exists a tree T with DD(T) = k and din(T) = LB(k) < B~(Kk). where LB(