Article contents
An Algorithm for a Minimum Cover of an Abstract Complex
Published online by Cambridge University Press: 20 November 2018
Extract
Let X = {x1, x2,...,xm} be a finite set of m points and = {A1, A2, . . . , An] be a class of n subsets of X. Such a system of points and sets is called a complex (X, ). If every set of the class contains two points, the complex is a graph with m points x1x2, . . . , xm and n edges A1, A2, . . . , An. A complex (X, ) in which every set has the same number of points is called regular.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1963
References
- 9
- Cited by