Paths in [h,k]-bipartite hypertournaments

Hong Yang and Jixiang Meng

Applied Mathematics and Computation, 2022, vol. 423, issue C

Abstract: Let m, n, h and k be four integers with 1≤h≤m and 1≤k≤n, and let U and W be two mutually disjoint nonempty vertex sets with |U|=m and |W|=n. An [h,k]-bipartite hypertournament BT with vertex sets U and W is a triple (U,W;A(BT)), where A(BT) is a set of (h+k)-subset of U∪W, called arcs with exactly h vertices from U and exactly k vertices from W, such that for any (h+k)-subset U1∪W1 of U∪W, A(BT) contains exactly one of the (h+k)! (h+k)-tuples whose entries belong to U1∪W1. In this paper, we prove that every [h,k]-bipartite hypertournament with m+n vertices, where 2≤h≤m−1 and 2≤k≤n−1, has a hamiltonian path.

Keywords: [h,k]-Bipartite hypertournament; Hamiltonian path; k-Hypertournament (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322000911
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:423:y:2022:i:c:s0096300322000911

DOI: 10.1016/j.amc.2022.127005

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 ().