#### Vol. 15, No. 2, 2022

 Recent Issues
 The Journal About the Journal Editorial Board Editors’ Interests Subscriptions Submission Guidelines Submission Form Policies for Authors Ethics Statement ISSN: 1944-4184 (e-only) ISSN: 1944-4176 (print) Author Index Coming Soon Other MSP Journals
A note on prime labeling $k$-partite $k$-graphs

### Arran Hamm, Jessica Hamm and Alan Way

Vol. 15 (2022), No. 2, 233–239
##### Abstract

A graph has a prime labeling if its vertices can be assigned distinct numbers from 1 to $|V|$ so that the vertices on each edge receive relatively prime labels. This definition can be extended naturally to hypergraphs, whose edges may contain more than two vertices, in the following way. A hypergraph has a prime labeling if its vertices can be assigned distinct numbers from 1 to $|V|$ so that the $\mathrm{gcd}$ of numbers within each edge is 1 (which is sensible since greatest common divisor is defined for sets of numbers).

We examine the problem of prime labeling complete $k$-partite $k$-uniform hypergraphs. We prove that if this type of hypergraph has enough vertices and every pod of vertices is large enough, then it does not have a prime labeling. We also prove, on the other hand, that if a pod of vertices is small enough, then it does have a prime labeling.

##### Keywords
prime labeling, $k$-partite $k$-uniform hypergraph
Primary: 05C78
Secondary: 05C65