A DECOMPOSITION OF COMPLETE BIPARTITE 4-UNIFORM HYPERGRAPH INTO LOOSE CYCLES
DOI:
https://doi.org/10.53555/eijms.v4i2.19Keywords:
Hypergraph, Loose Cycle, DecompositionAbstract
A k-uniform hypergraph H is a pair (V,ε), where V = {v1,v2,...,vn} is a set of n vertices and ε is a family of k-subset of V called hyperedges. We consider the problem of constructing a decomposition for complete bipartite uniform hypergraph into loose cycles.
References
. C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1979).
. J. C. Bermond, Hamiltonian decompositions of graphs, directed graphs and hypergraphs, Ann. Discrete Math. 3
(1978) 21-28.
. H. Verrall, Hamilton decompositions of complete 3-uniform hypergraphs, Discrete Math. 132 (1994) 333-348
. Jian-fang Wang, the theoretical base of hypergraphs(in Chinese), Beijing: Higher Education Press, 2006, 7
. Ronald Fagin, Degrees of Acyclicity for Hypergraphs and Relational Database Schemes, Journal of the Assoeiauon
for Computing Machinery, Vol 30, No 3, 1983,7: 514-550
. Duchet, P. Hypergraphs, Handbook of Combinatorics. The MIT Press, 381-423, 1995
. Jian-fang Wang, The Information Hypergraph Theory, Beijing: Science Press, 2008
Downloads
Published
Issue
Section
License
Copyright (c) 2018 International Journal of Mathematics and Statistics
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
