We show that if G is a graph embedded on the projective plane in such a way that each noncontractible cycle intersects G at least n times and the embedding is minimal with respect to this property (i.e., the representativity of the embedding is n), then G can be reduced by a series of reduction oper
Minimal Diameter of Certain Sets in the Plane
✍ Scribed by András Bezdek; Ferenc Fodor
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 91 KB
- Volume
- 85
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
✦ Synopsis
We investigate the problem of finding the smallest diameter D(n) of a set of n points such that all the mutual distances between them are at least 1. The asymptotic behaviour of D(n) is known; the exact value of D(n) can be easily found up to 6 points. Bateman and Erdo s proved that D(7)=2. In this paper we determine D(8).
📜 SIMILAR VOLUMES
If ␣ and  are positive roots in the root system of a Coxeter group W, we say that ␣ dominates  if w is negative whenever w␣ is negative for w g W. We say that ␣ is elementary or dominance-minimal, if it does not dominate any  / ␣. It Ž . is shown by the author and R. B. Howlett Math. Ann. 296, 1