A graph has a prime labeling if its vertices can be assigned distinct numbers from 1
to
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
so that
the
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
-partite
-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.
PDF Access Denied
We have not been able to recognize your IP address
18.97.14.87
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.