In [1] the concepts of paths and cycles of a hypergraph were introduced. In this paper, we give the concepts for bipartite hypergraph and Hamiltonian paths and cycles of a hypergraph, and prove that the complete bipartite 3-hypergraph with q vertices in earh part is Hamiltonian decomposable where q is a prime.
Acyclic hypergraphs are analogues of forests in graphs. They are very useful in the design of databases. In this article, the maximum size of an acyclic hypergraph is determined and the number of maximum γ-uniform acyclic hypergraphs of order n is shown to be
Jian-fang Wang, Hai-zhu LiInstitute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100080, China
