4$ڥ$K_n$쑓ڤ <$n-1$ڤڐڤڨڐڐڤڢ <ڍڐ 4$ڥ$K_n$쑓ڤړ$n-1$ڤڐ \begin{eqnarray*}\{\{\infty,i\},\{i-1,i+1\},\{i-2,i+2\},\ldots,\\ >\{i-\frac{n}{2}+1,i+\frac{n}{2}-1\}\}\pmod{n-1}\end{eqnarray*} <ڐڤڤڨڐڤ$\infty$ <ڢ줐ڢڤڀڗ$n-2$ڤړړڤ <ړ𣐤ړڤ$i$ړړڤړڤ$i$ <ړڍڢڝ$n-1$ꤢڐڢڢ <ڡړ 2$$K_n$쑓ڐꤐړڝڤ <ړڢڤڐړڤڐ 2$$K_n$쑓ڐꤐړڤ \begin{eqnarray*} >\{\{0,\infty\}\}+\{\{i+2jk,i+(2j+1)k\}|1\leq i\leq k,\\ >i+(2j+1)k\leq n-2,0\leq j\leq \frac{n-2}{2k}\} >\end{eqnarray*} 10$$K_n$ڟڄړڗ㢐 <$\frac{n-2}{2}$ڤڢ \bibitem{m1} Charles J. Colbourn and Jeffrey H. Dinitz, >{\em Latin Squares, MOLs and Orthogonal arrays}, >The CRC Handbook of Combinatorial Designs.