Resolvable 4-cycle group divisible designs with two associate classes: part size even (Q2468011): Difference between revisions

The graph \(K(a,p;\lambda_1,\lambda_2)\) consists of \(\lambda_1\) copies of \(K_a\) (where \(K_a\) is the complete graph on \(a\) vertices) plus \(\lambda_2\) edges between each pair of vertices in different copies. If \(V\) is the vertex set of a graph \(G\), and \(C\) is a set of copies of a graph \(H\) forming a \(H\)-decomposition of \(G\), then the decomposition is resolvable if \(C\) can be partitioned into subsets \(S\) such that each vertex of \(V\) appears in one copy of \(H\) in each \(S\). Let \(a\) be even. The authors show the necessary conditions are sufficient for existence of a resolvable \(C_4\)-decomposition of (1) \(K(a,p;\lambda_1,\lambda_2)\) if \(\lambda_1\) is even and (2) \(K(a,p;\lambda_1,\lambda_2)\) minus a 1-factor if \(\lambda_1\) is odd.