On constructing 1-factors of labelled complete graph (Q6960217)

This paper presents a clear and well-structured contribution to the study of 1-factors in labelled complete graphs, addressing a question posed by \textit{K. Ball} et al. [Mathematika 65, No. 3, 488--499 (2019; Zbl 1417.05021)] concerning 1-factor constructions linked to Hadamard-based factorizations. Using primitive roots of finite fields, the authors provide two constructive methods that yield 1-factors with distinct edge lengths and satisfying the quadratic-nonquadratic residue condition, and they successfully resolve the problem completely for the case \(p\equiv 5\pmod 8\). The arguments are rigorous, supported by concrete examples, and complemented by a discussion of special cases and open directions for further research. Overall, the paper makes a meaningful and technically solid contribution to combinatorial design theory and finite-field-based constructions.