← All problems

The odd-order near-factor characterization conjecture

12 years old · traced to

Let v=2n+1v=2n+1 be an odd integer, let KvK_v be the complete graph on {0,1,…,v−1}\{0,1,\ldots,v-1\}, and let LL be a list of nn positive integers not exceeding nn. A near 11-factor FF is a set of nn pairwise disjoint edges, and ℓ(F)\ell(F) is its list of edge-lengths. The near-factor characterization conjecture. There exists a near 11-factor FF of KvK_v such that ℓ(F)=L\ell(F)=L if and only if, for any divisor dd of vv, the number of multiples of dd appearing in LL does not exceed v−d2\frac{v-d}{2}. 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

Never refreshed

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.