Let m , n , h and k be four integers with 1 & LE; h & LE; m and 1 & LE; k & LE; 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 boolean OR W , called arcs with exactly h vertices from U and exactly k vertices from W , such that for any (h + k )-subset U 1 boolean OR W 1 of U boolean OR W , A(BT) contains exactly one of the (h + k ) ! (h + k)-tuples whose entries belong to U 1 boolean OR W 1 . In this paper, we prove that every [ h, k ]-bipartite hypertournament with m + n vertices, where 2 & LE; h & LE; m - 1 and 2 & LE; k & LE; n - 1 , has a hamiltonian path. (c) 2022 Elsevier Inc. All rights reserved.
NSTL
Elsevier
