Sharpness conjecture for the radio-k-number of even cycles

About 5 years old · traced to

Let nn be even and kk be odd with

n2⩽k<n−3.\frac{n}{2} \leqslant k < n-3.

Set

h=n−k−12,p=gcd⁡(n,h).h=\frac{n-k-1}{2},\qquad p=\gcd(n,h).

Write ⟨h⟩\langle h\rangle for the subgroup generated by hh in the relevant cyclic group. Sharpness conjecture. If n/2∈⟨h⟩n/2\in\langle h\rangle, then

rn⁡k(Cn)=LB⁡(n,k)+p−1.\operatorname{rn}_k(C_n)=\operatorname{LB}(n,k)+p-1.

The paper notes that the values of the radio kk-number are known for most parameters in the stated range, but cases with different parities remain open. The conjecture asserts that the upper bound from the preceding theorem is sharp whenever n/2∈⟨h⟩n/2\in\langle h\rangle.

References

Primary source

Colin Bloomfield, Daphne Der-Fen Liu and Jeannette Ramirez, “Radio-k-Labeling of Cycles for Large k”, arXiv:2106.15059 (2022).

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.