An Algorithm for a Minimum Cover of an Abstract Complex
D.K. Ray-Chaudhuri · Canadian Journal of Mathematics · 1963
Let X = { x 1 , x 2 ,..., x m } be a finite set of m points and = { A 1 , A 2 , . . . , A n ] 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 1 x 2 , . . . , x m and n edges A 1 , A 2 , . . . , A n . A complex ( X , ) in which every set has the same number of points is called regular .