"MATCH be the set of all graphs that have a perfect matching "
Is it decidable ?
My way of thinking :
Using Blossoms Theirem we can find whether graph has matching set or not in polynomial time , But there is no bound on Number of graphs then I think it is undecidable whether my graph has membership in MATCH.
Please help.
