Study on the Counting Problems of a Dual Set
Zhao Ling-qi · Journal of Inner Mongolia University for the Nationalities · 2009
In paper [1], a dual set of positive integers is recommend, and based on this a new edge building method is made for the completely 3-uniform hypergraph, and then a partition method is constructed for the all edges of . According to the demand of hypergraph circle, the hypergraphs’circle model is built and then studied the circle decomposition of different length of hypergraph . It needs to know the counting problem of this dual set for decomposition of all the edges of completely 3-uniform hypergraph . This paper studies the counting problem.