Extension of a clique cover result to uniform hypergraphs

✍ Scribed by A. Patricia Shelton; Ronald D. Dutton; Robert C. Brigham

• Publisher: Elsevier Science
• Year: 1986
• Tongue: English
• Weight: 137 KB
• Volume: 59
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(86)90081-6

✦ Synopsis

An r-uniform hypergraph is a structure H = (V, E), where V is a set of nodes and E is a collection of subsets of the nodes, called edges, each of which has size r. H is complete with p I> r nodes if it has all possible (~) edges and is empty if it has no edges. The complement of H is the r-uniform hypergraph H = (V,/~), where/~ contains exactly those edges not in E. A clique in H is either a maximal complete subhypergraph of H or an isolated node, i.e., a node which is in no edge. Oo(H) is the minimum number of cliques which include all nodes of H and