Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T20:51:15.864Z Has data issue: false hasContentIssue false

An Algorithm for a Minimum Cover of an Abstract Complex

Published online by Cambridge University Press:  20 November 2018

D. K. Ray-Chaudhuri*
Affiliation:
University of North Carolina
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let X = {x 1, x 2,...,x m} be a finite set of m points and = {A 1, A 2, . . . , 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 x 1x 2, . . . , xm and n edges A 1, A 2, . . . , An . A complex (X, ) in which every set has the same number of points is called regular.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1963