Abstract
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.
Similar content being viewed by others
Article PDF
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
GOODMAN, H. The Complete n-Point Graph. Nature 190, 840 (1961). https://doi.org/10.1038/190840a0
Issue Date:
DOI: https://doi.org/10.1038/190840a0
This article is cited by
-
The Early History of the Brick Factory Problem
The Mathematical Intelligencer (2010)
Comments
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.