Attempting perfect hypergraphs (Q6076187)

The authors investigate doubly-perfect hypergraphs. This class of graphs contains in addition to perfect graphs, a restricted interesting class of 3-uniform hypergraphs. The authors give within this class a complete characterization of doubly-perfect $H$-perfect hypergraphs. Their purpose is to provide several extensions of the notion of perfect graphs to $k$-uniform hypergraphs, $k>2$, based on coloring. They establish that a weaker coloring property which resembles the Berge property for graphs suffices for \(C_\omega\)-perfectness. They also provide a full description of doubly-perfect hypergraphs which are also $H$-perfect. Further, they discuss other related notions of perfectness and possible connections.