AbstractGiven a finite graph H and G, a subgraph of it, we define σ (G, H) to be the largest integer such that every pair of subgraphs of H, both isomorphic to G, has at least σ(G, H) edges in common; furthermore, R(G, H) is defined to be the maximum number of subgraphs of H, all isomorphic to G, such that any two of them have σ(G, H) edges common between them. We are interested in the values of σ(G, H) and R(G, H) for general H and G. A number of combinatorial problems can be considered as special cases of this question; for example, the classical set-packing problem is equivalent to evaluating R (G, H) where G is a complete subgraph of the complete graph H and σ(G, H) = 0, and the decomposition of H into subgraphs isomorphic to G is equivalent to showing that σ(G, H) = 0 and R(G, H) = ε(H)/ε(G) where ε(H), ε(G) are the number of edges in H, G respectively.A result of S. M. Johnson (1962) gives an upper bound for R(G, H) in terms of σ(G, H). As a corollary of Johnson's result, we obtain the upper bound of McCarthy and van Rees (1977) for the Cordes problem. The remainder of the paper is a study of σ (G, H) and R(G, H) for special classes of graphs; in particular, H is a complete graph and G is, in most instances, a union of disjoint complete subgraphs.
On Complexity of Optimal Recombination for Binary Representations of Solutions
