A note on prime labeling \(k\)-partite \(k\)-graphs (Q2163042): Difference between revisions

A prime labeling of a hypergraph on a vertex \(V\) is a labeling of its vertices by numbers \([1,\dots,\left\vert V\right\vert ]\) such that the labels within each hyperedge have the greatest common divisor \(1\). A complete balanced \(k\)-partite \(k\)-hypergraph has a vertex set \(A_{1}\cup \dots\cup A_{k}\), \(\left\vert A_{i}\right\vert =\left\vert A_{j}\right\vert \), \(1\leq i,j\leq k\), with \(E\) being its edge iff \(\left\vert E\cap A_{i}\right\vert =1\) for \(i\in \lbrack 1,\dots,k]\). In the paper, it is shown that for \(k\geq 3\), a complete balanced \(k\)-partite \(k\)-hypergraph with \(\left\vert A_{i}\right\vert =n\) is prime for almost no values of \(n\).