Let G be a family of n-vertex graphs of uniform degree 2 with the property
that the union of any two member graphs has degree four. We determine the
leading term in the asymptotics of the largest cardinality of such a family.
Several analogous problems are discussed.Comment: 9 page
