𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The maximum number of second smallest distances in finite planar sets

✍ Scribed by Peter Brass

Publisher
Springer
Year
1992
Tongue
English
Weight
457 KB
Volume
7
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The two largest distances in finite plan
The two largest distances in finite planar sets
✍ Katalin Vesztergombi πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 333 KB

We determine all homogenous linear inequalities satisfied by the numbers of occurrences of the two largest distances among n points in the plane.

The structure and maximum number of maxi
The structure and maximum number of maximum independent sets in trees
✍ Jennifer Zito πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 732 KB

A subset of vertices is a maximum independent set if no two of the vertices are joined by an edge and the subset has maximum cardinality. In this paper we answer a question posed by Herb Wilf. We show that the greatest number of maximum independent sets for a tree of n vertices is 2(n-3\* for odd n

On the distribution of distances in fini
On the distribution of distances in finite sets in the plane
✍ K Vesztergombi πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 894 KB

Let n k denote the number of times the kth largest distance occurs among a set S of n points. We show that if S is the set of vertices of a convex polygone in the euclidean plane, then n1+2n2~3n and n2<~n +n 1. Together with the well-known inequality n~<~n and the trivial inequalities n~>~O and n2>~