Uniform hypergraphs and dominating sets of graphs

Jaume Martí-Farré, Mercè Mora, José Luis Ruiz

A (simple) hypergraph is a family H of pairwise incomparable sets of a finite set. We say that a hypergraph H is a domination hypergraph if there is at least a graph G such that th…