Some characterizations of γ and β-acyclicity of hypergraphs

The notions of @c and @b-acyclicity are two classic generalizations of the acyclicity of graphs to hypergraphs. They satisfy the property that, if a hypergraph is @c-acyclic then it is @b-acyclic, and the reverse is false. We give some new properties concerning these notions. First we show that we can strictly insert another notion of acyclicity between them, namely the fact of having a join tree with disjoint branches. And if we add a condition on the existence of such a join tree, we obtain a notion equivalent to @c-acyclicity. Then we present two characterizations, consisting in applying successively a small set of rules, deciding @c and @b-acyclicity respectively.