SETS DEFINING MINIMAL VERTEX COVERS OF UNIFORM HYPERGRAPHS
Mehrdad Nasernejad, Kazem Khashyarmanesh · HAL (Le Centre pour la Communication Scientifique Directe) · 2025
Suppose that V = {1, . . . , n} is a non-empty set of n elements, A = {A 1 , . . . , A m } a non-empty family of m non-empty subsets of V , and 2 ≤ d ≤ n a positive integer. In this paper, we investigate the question arises whether there exists a d-uniform hypergraph H with V (H) = V where A is the set whose elements are the minimal vertex cover sets of H.