Minimum coprime number conjecture for GP(3k,k)
Minimum coprime number conjecture for GP(3k,k)
Let , and let be the generalized Petersen graph. Let denote its minimum coprime number. The minimum-coprime-number conjecture.
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
Sign in to submit a solution.
No solutions have been posted yet.