Closure operations by hypergraph approach

Abstract

In this paper, we study how to approach some combinatorial problems of closure operations using a hypergraph. We prove that all minimal keys of the closure operations can be represented with the transversal hypergraph of a family. We establish the relationship between anti keys and minimal keys of the closure operations in the hypergraph.