Geodesic
A Packing Inequality for Compact Convex Subsets of the Plane
Canadian mathematical bulletin, Tome 12 (1969) no. 6, pp. 745-752

Voir la notice de l'article provenant de la source Cambridge

DOI

Let X be a compact metric space. By a packing in X we mean a subset S ⊆ X such that, for x, y ∈ S with x ≠ y, the distance d(x, y) ≥ 1. Since X is compact, any packing of X is finite. In fact, the set of numbers{card(S): S is a packing in X}is bounded. The cardinality of the largest packing in X will be called the packing number of X and will be denoted by ρ(X). If A(X) and P(X) denote the area and perimeter, respectively, of a compact convex subset X of the plane, then a special case of a result conjectured by H. Zassenhaus [6] and proved by N. Oler [l] is the following. 
Folkman, J. H.; Graham, R. L. A Packing Inequality for Compact Convex Subsets of the Plane. Canadian mathematical bulletin, Tome 12 (1969) no. 6, pp. 745-752. doi: 10.4153/CMB-1969-096-7
@article{10_4153_CMB_1969_096_7,
     author = {Folkman, J. H. and Graham, R. L.},
     title = {A {Packing} {Inequality} for {Compact} {Convex} {Subsets} of the {Plane}},
     journal = {Canadian mathematical bulletin},
     pages = {745--752},
     year = {1969},
     volume = {12},
     number = {6},
     doi = {10.4153/CMB-1969-096-7},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1969-096-7/}
}
TY  - JOUR
AU  - Folkman, J. H.
AU  - Graham, R. L.
TI  - A Packing Inequality for Compact Convex Subsets of the Plane
JO  - Canadian mathematical bulletin
PY  - 1969
SP  - 745
EP  - 752
VL  - 12
IS  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1969-096-7/
DO  - 10.4153/CMB-1969-096-7
ID  - 10_4153_CMB_1969_096_7
ER  - 
%0 Journal Article
%A Folkman, J. H.
%A Graham, R. L.
%T A Packing Inequality for Compact Convex Subsets of the Plane
%J Canadian mathematical bulletin
%D 1969
%P 745-752
%V 12
%N 6
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1969-096-7/
%R 10.4153/CMB-1969-096-7
%F 10_4153_CMB_1969_096_7

Cité par Sources :