A hypergraph H is a pair (V,E), where V is a finite set of vertices, E is a family of subsets of V (called hyperedges or edges). In the past 40 years, Graph theory was widely considered to be a very useful tool when solve the combinatorial problems in the field such as geometry, number theory, operations research and optimization. In order to solve more combinatorial problems, promote the concept grape to the hypergraph is a very natural thing. We use the method in the combinatorial designs to study hypergraph. In this thesis, We show that a decomposition of the 3-uniform hypergraph into a special kind of hypergraph exists if and only if v 1,2,6(mod 8) and v 6.
参考文献
相似文献
引证文献
引用本文
吴艳. 超图 的一种特殊类型的分解[J]. 科学技术与工程, 2010, (16): . wuyan. Decompositions of the 3-uniform hypergraphs into hypergraphs of a certain type[J]. Science Technology and Engineering,2010,(16).