✦ LIBER ✦

A note on distinct distance subsets

✍ Scribed by Charalambides, Marcos

Book ID: 121596975
Publisher: Springer
Year: 2013
Tongue: English
Weight: 130 KB
Volume: 104
Category: Article
ISSN: 0047-2468
DOI: 10.1007/s00022-013-0176-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on the Number of Distinct Distanc

A Note on the Number of Distinct Distances

✍ G. Elekes 📂 Article 📅 1999 🏛 Springer Netherlands 🌐 English ⚖ 178 KB

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

Note on Large Subsets of Binary Vectors

Note on Large Subsets of Binary Vectors with Similar Distances

✍ Gutin, Gregory; Jones, Mark 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 130 KB

A Note on Degrees of Subsets

✍ Robert I. Soare 📂 Article 📅 1969 🏛 Association for Symbolic Logic 🌐 English ⚖ 177 KB

A note on a finite subset of a group clo

A note on a finite subset of a group closed under multiplication of distinct elements

✍ Zvi Arad; John Lennox 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 101 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(