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.

Access options

Rent or Buy article

Get time limited or full article access on ReadCube.


All prices are NET prices.

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

GOODMAN, H. The Complete n-Point Graph. Nature 190, 840 (1961).

Download citation

Further reading


By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.