Perfect matching and Hamilton cycle decomposition of complete balanced (k+1)-partite k-uniform hypergraphs

Yi Zhang, Mei Lu and Ke Liu

Applied Mathematics and Computation, 2020, vol. 386, issue C

Abstract: Let Kk+1,n(k) denote the complete balanced (k+1)-partite k-uniform hypergraph, whose vertex set consists of k+1 parts, each has n vertices and whose edge set contains all the k-element subsets with no two vertices from one part. In this paper, we prove that if k∣n and (nk,k)=1, then Kk+1,n(k) has a perfect matching decomposition; if (n,k)=1, then Kk+1,n(k) has a Hamilton tight cycle decomposition. In both cases, we use constructive methods which imply that we also give a polynomial algorithm to find a perfect matching decomposition or a Hamilton tight cycle decomposition.

Keywords: Uniform hypergraphs; Perfect matching decomposition; Hamilton tight decomposition (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320304501
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:386:y:2020:i:c:s0096300320304501

DOI: 10.1016/j.amc.2020.125492

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().