Some cyclic solutions to the three table Oberwolfach problem (Q2583658)

The Oberwolfach problem is to decompose the complete graph \(K_n\), for odd \(n\), into mutually isomorphic 2-factors. If the lengths of the cycles in each 2-factor are \(r_1,r_2,\dots,r_t\), where \(r_1+r_2+\cdots+r_t=n\), then the problem is denoted \(\text{ OP}(r_1,r_2,\ldots,r_t)\). The author proves that for every odd \(r\geq 3\) and even \(r\) with \(4\leq r\leq 16\), there is a number \(N_r\) such that \(\text{ OP}(r,r,s)\) has a cyclic solution whenever \(s\geq N_r\). Collecting together old and new results, the author shows that \(\text{ OP}(r,r,s)\) has a cyclic solution for every odd \(s\geq 5\) when \(3\leq r\leq 13\), excluding the insoluble case \(\text{ OP}(3,3,5)\).