Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-10T02:27:27.026Z Has data issue: false hasContentIssue false
  • English
  • Français

Neighbourliness and Radon's theorem

Published online by Cambridge University Press:  26 February 2010

G. C. Shephard
G. C. Shephard
Affiliation:
The University of East Anglia, Norwich.
Get access

Extract

Let X be a finite set of points in Ed. Then a partition of X into two non-empty subsets X1 and X2 (X1 ∪ X2 = X, X1 ∩ X2 = ∅) will be called a Radon partition if

.

Information

Type
Research Article
Information
Mathematika , Volume 16 , Issue 2 , December 1969 , pp. 273 - 275
Copyright
Copyright © University College London 1969

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1.Gale, D., “Neighbouring vertices on a convex polyhedron”. In Linear Inequalities and Related Systems (Princeton, 1956), 255–263.Google Scholar
2.Grünbaum, B., Convex Polytopes (London-New York-Sydney, 1967).Google Scholar
3.Reay, J. R., “An extension of Radon's theorem”, Illinois J. Math., 12(1968), 184–189.CrossRefGoogle Scholar