Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Erd's Diophantine Graph
CHF 43.10
Auf Lager
SKU
NMG7LAJSLSO
1 Verfügbar 
Geliefert zwischen Fr., 23.01.2026 und Mo., 26.01.2026
Details
High Quality Content by WIKIPEDIA articles! 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 Z 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 Diophantine graphs are named after Paul Erd s and Diophantus of Alexandria. They form a subset of the set of Diophantine figures, which are defined as complete graphs in the Diophantine plane for which the length of all edges are integers. Thus, Erd s Diophantine graphs are exactly the Diophantine figures that cannot be extended. The existence of Erd s Diophantine graphs follows from the Erd s Anning theorem,
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131197147
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131197147
- Format Fachbuch
- Titel Erd's Diophantine Graph
- Herausgeber Betascript Publishing
- Anzahl Seiten 100
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
