The mu-way intersection problem for m-cycle systems

An m-cycle system of order upsilon is a partition of the edge-set of a complete graph of order upsilon into m-cycles. The mu -way intersection problem for m-cycle systems involves taking mu systems, based on the same vertex set, and determining the possible number of cycles which can be common to all mu systems. General results for arbitrary m are obtained, and detailed intersection values for (mu, m) = (3, 4), (4, 5),(4, 6), (4, 7), (8, 8), (8, 9). (For the case (mu, m)= (2, m), see Billington (J. Combin. Des. 1 (1993) 435); for the case (Cc,m)=(3,3), see Milici and Quattrochi (Ars Combin. A 24 (1987) 175. (C) 2001 Elsevier Science B.V. All rights reserved.

Closure of the Challinor Centre II: An extended report on 95 individuals after 12 months of community living

As part of an institutional closure programme, 95 individuals with an intellectual disability were relocated to community-based group homes. Each individual was assessed 6 months prior to the relocation and then again after 1, 6, and 12 months of community living. Assessments involved ratings of adaptive and maladaptive behaviour, choice-making, and life circumstances. The group means comparing institution to community ratings showed improvements in adaptive functioning but no significant change in maladaptive behaviour. There were also improvements in life circumstances and increased opportunities for choice-making following relocation to the community. These outcomes suggest that relocation to the community was associated with a more active and normalised lifestyle than experienced in the institutional setting.

On the intersection problem for 1-factorizations and near 1-factorizations of K-v

The number of 1-factors (near 1-factors) that mu 1-factorizations (near 1-factorizations) of the complete graph K-v, v even (v odd), can have in common, is studied. The problem is completely settled for mu = 2 and mu = 3.