Cyclic interval conjecture for odd cycles
Cyclic interval conjecture for odd cycles
Let be odd and let with . An arc is a cyclic interval in . Write for the cycle graph on vertices, and let denote the minimum dimension of an isometric embedding of into an abelian group. The lemma asserts that there is an arc satisfying
Cyclic interval conjecture. The displayed inequality holds for every odd and every nonempty proper subset ; consequently,
for every odd cycle .
The inequality is the remaining case beyond the covering-arc regime and has been verified exhaustively for all odd . If true, it gives the naive-dimension lower bound for every odd cycle; the general case remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Fokam Souop Rigobert and Bitjoka Laurent, “Minimal Isometric Embeddings of Graphs into Abelian Groups: Theory, Algorithms, and Applications to Signal Processing over Networks”, arXiv:2606.29391 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.