Minimum coprime number conjecture for GP(3k,k)

Let k2k\geq 2, and let GP(3k,k)GP(3k,k) be the generalized Petersen graph. Let pr(G)\mathfrak{pr}(G) denote its minimum coprime number. The GP(3k,k)GP(3k,k) minimum-coprime-number conjecture.

pr(GP(3k,k))={7kif k is odd,7k+1if k is even.\mathfrak{pr}(GP(3k,k))=\begin{cases}7k & \text{if } k \text{ is odd},\\ 7k+1 & \text{if } k \text{ is even}.\end{cases}

The source presents this as a conjecture motivated by independence-number bounds and reports verification only for small cases.

Sources & referencesView supporting material

Primary source

John Asplund and N. Bradley Fox, “Minimum Coprime Labelings of Generalized Petersen and Prism Graphs”, arXiv:1908.06051 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.