✦ LIBER ✦

A postscript on distances in convexn-gons

✍ Scribed by Paul Erdos; Peter Fishburn

Book ID: 110560970
Publisher: Springer
Year: 1994
Tongue: English
Weight: 261 KB
Volume: 11
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02573998

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the largest convex polygon contained

On the largest convex polygon contained in a non-convexn-gon, or how to peel a potato

✍ Jacob E. Goodman 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 333 KB

The maximum number of unit distances in

The maximum number of unit distances in a convex n-gon

✍ Zoltȧn Füredi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 216 KB

A postscript on colleges in collusion

✍ Paul M. Sommers 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 202 KB

A postscript on steadfast rings and R-al

A postscript on steadfast rings and R-algebras in one variable

✍ Eloise Hamann 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 640 KB

A note on average distances in digital s

A note on average distances in digital sets

✍ Azriel Rosenfeld 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 218 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(