Erdős–Diophantine graph
id:
erd-s-diophantine-graph-247-12378872
title:
Erdős–Diophantine graph
text:
An Erdős–Diophantine graph is an object in the mathematical subject of Diophantine equations consisting of a set of integer points at integer distances in the plane that cannot be extended by any additional points. Equivalently, in geometric graph theory, it can be described as a complete graph with vertices located on the integer square grid Z 2 such that all mutual distances between the vertices are integers, while all other grid points have a non-integer distance to at least one vertex. Erdős
brand slug:
wiki
category slug:
encyclopedia
description:
Complete graph on the integer plane which cannot be expanded
original url:
https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Diophantine_graph
date created:
date modified:
2022-06-24T00:06:55Z
main entity:
{"identifier":"Q5385321","url":"https://www.wikidata.org/entity/Q5385321"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/6/64/5-point_Erd%C5%91s-Diophantine_graph.svg","width":288,"height":360}
fields total:
13
integrity:
15