A note on Erdős-Diophantine graphs and Diophantine carpets

Details A note on Erdős-Diophantine graphs and Diophantine carpets A note on Erdős-Diophantine graphs and Diophantine carpets

2005-11-29

arxiv.org/abs/math/0511705v1

Mathematics

Combinatorics

4 pages, 1 figure

Scientific paper

A Diophantine figure is a set of points on the integer grid $\mathbb{Z}^{2}$ where all mutual Euclidean distances are integers. We also speak of Diophantine graphs. In this language a Diophantine figure is a complete Diophantine graph. Due to a famous theorem of Erd\H{o}s and Anning there are complete Diophantine graphs which are not contained in larger ones. We call them Erd\H{o}s-Diophantine graphs. A special class of Diophantine graphs are Diophantine carpets. These are planar triangulations of a subset of the integer grid. We give an effective construction for Erd\H{o}s-Diophantine graphs and characterize the chromatic number of Diophantine carpets.

Affiliated with

Also associated with

No associations

Rating

A note on Erdős-Diophantine graphs and Diophantine carpets 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 A note on Erdős-Diophantine graphs and Diophantine carpets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on Erdős-Diophantine graphs and Diophantine carpets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-715731