It is known, [1]} that
if \(G\)  is a \(k\) -uniform chordal hypergraph (according to the definition above)
then it \(\chi ^C\) -bounded,
in other words if \(\alpha =\alpha (G)\)  then \(G\)  can be covered by \(f(\alpha ,k)\)  cliques.
