Maximum Bounded H-Matching is MAX SNP-Complete

Abstract We prove that maximum H-matching (the problem of determining the maximum number of node-disjoint copies of the fixed graph H contained in a variable graph) is a M AX SNP-hard problem for any graph H that has three or more nodes in some connected component. If H is connected and the degrees of the nodes in H are bounded by a constant the problem is M AX SNP-complete.