## Erdos distance problem n=12

The recent paper On the Erdos distinct distance problem in the plane Authors: Larry Guth, Nets Hawk Katz prodded me to get a non-trivial example. Here is what I cannot find: and example of 12 distinct points in the plane with only 5 different distances between points. The regular 12-polygon has 6 different lengths but I cannot do better. http://oeis.org/A186704 implies that there is one>

-

I wish I could get images to work, but here goes my poor explanation:

Take a regular hexagonal lattice with distance 1 between nearest neighbors, and choose a 15-point equilateral triangle in this lattice (15 is a triangular number). Remove the 3 verticies of the triangle. You'll be left with 12 points and 5 distinct distances.

edit: just checked the OEIS reference, and it's available on google books. The picture you want is on page 200 at http://books.google.com/books?id=cT7TB20y3A8C&printsec=frontcover&dq=Research+Problems+in+Discrete+Geometry&source=bl&ots=amqJ7zFfB4&sig=U99_5spjO8UIwbehycahkz6M2yg&hl=en&ei=Hql6TeyFKpDrrAHm7bzCBQ&sa=X&oi=book_result&ct=result&resnum=5&ved=0CEMQ6AEwBA#v=onepage&q&f=false

-

Thanks this was driving me crazy.

-

If I may supplement Logan Maingi's apposite answer with a snapshot of the page to which he refers:

(I couldn't resist including the surrounding conjecture.)

-
 Thanks! I tried to no avail to embed the image, but I'm still rather bad with TeX and couldn't get it to work. – The Cheese Stands Alone Mar 14 2011 at 14:35