Maximum number of spanning cycles with no common edge in a complete graph A new class has just been started, and there are $n$ people in this class that do not know each other. At each session they sit around a round table. They decided to change their adjacent persons in each session, so that all people come to know each other as soon as possible. What is the minimum number of sessions after which all people know each other?
To solve the above problem, I associated a graph to each session where the nodes are the persons and the neighbours to each person are connected to that person via an edge. So the degree of each node is $2$. Indeed, each session is a cycle which includes all nodes (persons) of the graph. So the question is how many spanning cycles exist in a complete graph that do not have any common edge? A common edge is not allowed since it represents a repeated neighbor for some person.
A complete graph with $n$ nodes has $\frac{n(n-1)}{2}$ edges and each cycle is going to include $n$ of these edges. So, I think if we are lucky and can use all of the edges to build such cycles then at most we can make $\frac{n-1}{2}$ of these cycles.
$1$. Is this argument valid?
$2$. Can we use all of the edges to make such cycles?

The solution is easy when $n=2m+1$ is an odd prime: In round $k$, $1\le k\le m$, put person $i$ on seat $ki\bmod n$ (people and seats are numbered from $0$ to $n-1$). This uses the minimal number of $m=\frac{n-1}2$ rounds and we check that persons $x,y$ meet in round $\min\{|x-y|,n-|x-y|\}$.
If $n$ is odd, but composite, the above method does not work immediately: When $1<k\mid n$, we'd try to place several people on the same seats. We can try to disentangle this, but that results in $\frac nk$ meets being replaced with other distances ... but I suppose this may still be doable for some $n$ (perhaps with some exceptions such as squares od primes? I didn' try all yet)
When $n$ is even, we of course cannot even hope to achieve $\frac{n-1}2$.
