✦ LIBER ✦

A Note on the Number of Distinct Distances

✍ Scribed by G. Elekes

Book ID: 111537089
Publisher: Springer Netherlands
Year: 1999
Tongue: English
Weight: 178 KB
Volume: 38
Category: Article
ISSN: 0031-5303
DOI: 10.1023/a:1004802524095

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Expected Distances

✍ Bryan H. Massam 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB

Note on the hybridization number and sub

Note on the hybridization number and subtree distance in phylogenetics

✍ Peter J. Humphries; Charles Semple 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 452 KB

For two rooted phylogenetic trees T and T , the rooted subtree prune and regraft distance between T and T has often been used as a replacement for the hybridization number of T and T .

On Distinct Distances from a Vertex of a

On Distinct Distances from a Vertex of a Convex Polygon

✍ Adrian Dumitrescu 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 126 KB

A NOTE ON THE DERIVATION OF NEAREST NEIG

A NOTE ON THE DERIVATION OF NEAREST NEIGHBOR DISTANCES.

✍ Michael F. Dacey 📂 Article 📅 1960 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

A note on generalization of distinct rep

A note on generalization of distinct representatives

✍ Feng-Shun Chai 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 211 KB

Agrawal (1966 Ann. Math. Statist. 37, 525-528) explored the concept of systems of distinct representatives to show that the treatments in a binary equireplicated incomplete block design can be rearranged within blocks such that the treatments occur as close to equally often as possible in every row.

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(