Vés al contingut (premeu Retorn)

Uniform hypergraphs and dominating sets of graphs

Martí-Farré, J.; Mora, M.; Ruiz, J.L.
Tipus d'activitat
Document cientificotècnic
URL Obrir en finestra nova
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 the collection of minimal dominating sets of G is equal to H. Given a hypergraph, we are interested in determining if it is a domination hypergraph and, if this is not the case, we want to find domination hypergraphs in some sense close to it, the domination completions. Here we will focus on the family of hypergraphs co...
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
DCG - Discrete and Combinatorial Geometry