The \(\mu\)-way intersection problem for \(m\)-cycle systems (Q5937574)

A partition of a complete graph of order \(v\) into \(m\)-cycles is called an \(m\)-cycle system of order \(v\). In the paper under review, the authors consider the problem for finding all possible numbers of cycles which can be common to \(\mu\) \(m\)-cycle systems based on the same vertex \(v\)-set. General results for arbitrary \(m\) are obtained and intersection values for some small values of \(m\) and \(\mu\) are determined.