Let  be an (edge-)colored graph, i.e., G is assigned a mapping  the set of colors. A matching of G is called heterochromatic if its any two edges have different colors. Unlike uncolored matchings for which the maximum matching problem is solvable in polynomial time, the maximum heterochromatic matching problem is NP-complete. In this paper, by enumerative combinatorics method, we give contains a heterochromatic matching with cardinality at least if each of color appears on exactly s edges for And we also show that if every color of appears on n edges, then contains a heterochromatic matching of cardinality at least