Sharpness conjecture for the radio-k-number of even cycles
Sharpness conjecture for the radio-k-number of even cycles
Let be even and be odd with
Set
Write for the subgroup generated by in the relevant cyclic group. Sharpness conjecture. If , then
The paper notes that the values of the radio -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 .
Sources & referencesView supporting material
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
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.