Small distances in convex polygons

Let d(1) < d(2) < ... denote the set of all distances between two vertices of a convex n-gon. We show that the number of pairs of vertices at distance d(2) from one another is at most n + O(1). (C) 2013 Elsevier B.V. All rights reserved.


Published in:
Discrete Mathematics, 313, 18, 1767-1782
Year:
2013
Publisher:
Amsterdam, Elsevier Science Bv
ISSN:
0012-365X
Keywords:
Laboratories:




 Record created 2013-10-01, last modified 2018-01-28


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)