| has gloss | eng: An Erdős–Diophantine graph is an object in the mathematical subject of Diophantine geometry consisting of a set of integer points at integer distances in the plane that cannot be extended by any additional points. Equivalently, it can be described as a complete graph with vertices located on the integer square grid \scriptstyle\mathbbZ}^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. |
| lexicalization | eng: Erdos Diophantine Graph |
| lexicalization | eng: Erdos-Diophantine Graph |
| lexicalization | eng: Erdős Diophantine Graph |
| lexicalization | eng: Erdős-Diophantine graph |
| lexicalization | eng: Erdős–Diophantine graph |
| instance of | c/Geometric graphs |
