The α-Arboricity of Complete Uniform Hypergraphs
J. -C. Bermond, Yeow Meng Chee, Nathann Cohen, X. Zhang · SIAM Journal on Discrete Mathematics · 2011
α-acyclicity is an important notion in database theory. The α-arboricity of a hypergraph [Formula: see text] is the minimum number of α-acyclic hypergraphs that partition the edge set of [Formula: see text]. The α-arboricity of the complete 3-uniform hypergraph is determined completely.