P 11.

P. Erdös; L. Moser

doi:10.1017/S0008439500024863

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Edelsbrunner, Herbert and Hajnal, Péter 1991. A lower bound on the number of unit distances between the vertices of a convex polygon. Journal of Combinatorial Theory, Series A, Vol. 56, Issue. 2, p. 312.

Moser, W. and Pach, J. 1993. New Trends in Discrete and Computational Geometry. Vol. 10, Issue. , p. 281.

Füredi, Zoltán 1995. Proceedings of the International Congress of Mathematicians. p. 1343.

Erdös, Paul and Fishburn, Peter 1995. Intervertex distances in convex polygons. Discrete Applied Mathematics, Vol. 60, Issue. 1-3, p. 149.

Fishburn, Peter 1997. The Mathematics of Paul Erdös II. Vol. 14, Issue. , p. 284.

Pach, János and Pinchasi, Rom 2003. How Many Unit Equilateral Triangles Can Be Generated byNPoints in Convex Position?. The American Mathematical Monthly, Vol. 110, Issue. 5, p. 400.

Füredi, Zoltán and Simonovits, Miklós 2013. Erdős Centennial. Vol. 25, Issue. , p. 169.

Fishburn, Peter 2013. The Mathematics of Paul Erdős I. p. 483.

Article contents

P 11.

Abstract

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests