Eleven Unit Distance Embeddings of the Heawood Graph

Details Eleven Unit Distance Embeddings of the Heawood Graph Eleven Unit Distance Embeddings of the Heawood Graph

2009-12-30

arxiv.org/abs/0912.5395v1

Mathematics

Combinatorics

V1: documentclass amsart, 8 pages, 13 figures

Scientific paper

In this note we present eleven unit distance embeddings of the Heawood graph, i.e. the point-line incidence graph of the finite projective plane of order two, by way of pictures and 15 digit approximations of the coordinates of the vertices. These together with the defining algebraic equations suffice to calculate arbitrarily exact approximations for the exact embeddings, and so to show that the Heawood graph indeed is a unit-distance graph. Thus we refute a "suspicion" of V. Chvatal from 1972.

Affiliated with

Also associated with

No associations

Rating

Eleven Unit Distance Embeddings of the Heawood Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Eleven Unit Distance Embeddings of the Heawood Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Eleven Unit Distance Embeddings of the Heawood Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33898