𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of different distances determined by n points in the plane

✍ Scribed by F.R.K Chung

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
494 KB
Volume
36
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The directions determined by n points in
The directions determined by n points in the plane: a matroidal generalization
✍ Raul Cordovil πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 660 KB

Scott posed the problem of determining the minimum number of directions determined by n points which are not all collinear in the plane. We consider a generalization of this problem for oriented marroids. We prove the following theorem: Let M denote an oriented matroid of rank 3. Suppose M has a mod

On the Number of Directions Determined b
On the Number of Directions Determined by a Set of Points in an Affine Galois Plane
✍ TamΓ‘s SzΕ‘nyi πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 265 KB

In this paper the number of directions determined by a set of q&n points of AG(2, q) is studied. To such a set we associate a curve of degree n and show that its linear components correspond to points that can be added to the set without changing the set of determined directions. The existence of li

Graphs embedded in the plane with a boun
Graphs embedded in the plane with a bounded number of accumulation points
✍ C. Paul Bonnington; R. Bruce Richter πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 138 KB πŸ‘ 1 views

## Abstract Halin's Theorem characterizes those infinite connected graphs that have an embedding in the plane with no accumulation points, by exhibiting the list of excluded subgraphs. We generalize this by obtaining a similar characterization of which infinite connected graphs have an embedding in