Horak–Rosa conjecture on realizable and admissible chord multisets

From papers

Consider nn equally spaced points on a circle and write m=n/2m=\lfloor n/2\rfloor. A multiset is represented as [1,,m][\ell_1,\ldots,\ell_m], where j\ell_j counts chords of type jj. Let Mn\mathcal{M}_n be the class of multisets satisfying j=1mj=n1\sum_{j=1}^m\ell_j=n-1. Let AnMn\mathcal{A}_n\subseteq\mathcal{M}_n be the class satisfying, for every divisor dd of nn,

j=1m/djdnd,\sum_{j=1}^{\lfloor m/d\rfloor}\ell_{jd}\leq n-d,

and let Rn\mathcal{R}_n be the class of multisets associated with a path using every point exactly once. Horak–Rosa conjecture. For every n1n\geq 1,

Rn=An.\mathcal{R}_n=\mathcal{A}_n.

This generalizes Buratti's prime case and characterizes exactly which chord-type multisets are realizable by the necessary admissibility inequalities. The conjecture 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

Brendan D. McKay and Tim Peters, “Paths through equally spaced points on a circle”, arXiv:2205.06004 (2022).

Solutions 0

No solutions have been posted yet.