The odd-order near-factor characterization conjecture
Let be an odd integer, let be the complete graph on , and let be a list of positive integers not exceeding . A near -factor is a set of pairwise disjoint edges, and is its list of edge-lengths. The near-factor characterization conjecture. There exists a near -factor of such that if and only if, for any divisor of , the number of multiples of appearing in does not exceed . This is presented as a generalization of Bacher's problem for odd order. The supplied text gives no resolution.
References
2 papers in this index state this conjecture (2014–2023). The statement above is taken from the most recent of them; the others are arXiv:1404.3890.
Source: M. Meszka, A. Pasotti and M. A. Pellegrini, “The seating couple problem in even case”, arXiv:2308.16553 (2023).
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
No solutions have been posted yet.