The Complete n -Point Graph
A COMPLETE n -point graph consists of n points in a plane (or on the surface of a sphere), each joined to all the others by lines, not necessarily straight. The problem of determining the minimum number of intersections, m , for various values of n is being investigated.
Gespeichert in:
| Veröffentlicht in: | Nature (London) 1961-05, Vol.190 (4778), p.840-840 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | A COMPLETE
n
-point graph consists of
n
points in a plane (or on the surface of a sphere), each joined to all the others by lines, not necessarily straight. The problem of determining the minimum number of intersections,
m
, for various values of
n
is being investigated. |
|---|---|
| ISSN: | 0028-0836 1476-4687 |
| DOI: | 10.1038/190840a0 |