We determine the maximum number of points in
which form
exactly
distinct triangles, where we restrict ourselves to the case of
. We denote this
quantity by
.
It is known from the work of Epstein et al. (Integers 18 (2018), art. id. A16) that
. Here we show somewhat
surprisingly that
and
,
whenever
,
and characterize the optimal point configurations. This is an extension of a variant of
the distinct distance problem put forward by Erdős and Fishburn (Discrete Math.160:1-3 (1996), 115–125).
PDF Access Denied
We have not been able to recognize your IP address
18.119.131.178
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.