Discrete MathematicsVolume 160, Issues 1–3, 15 November 1996, Pages 115-125Regular paperMaximum planar sets that determine k distancesAuthor links open overlay panelPaul Erdős a, Peter Fishburn bShow moreShareCitehttps://doi.org/10.1016/0012-365X(95)00153-NGet rights and contentUnder an Elsevier user licenseopen archiveAbstractMaximum planar sets that determine k distances are identified for k ⩽ 5. Evidence is presented for the conjecture that all maximum sets for k ⩾ 7 are subsets of the triangular lattice.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1996 Published by Elsevier B.V.
