I think i proved P=NP with the following:
Given a graph G, find any odd cycle in G.
If you have an odd cycle that has no nodes in common with any other odd cycle, it can be easily shown to be a perfect match.
How does this prove that P=NP.
Since this is a proof by contradiction, this proof means if P=NP and P isn't NP then we would have an algorithm that solves NP-Complete problems. If that is the case then obviously P=NP because any NP-Complete problems can be written to a NP-Complete problem, thus you would have to prove that this new problem is not NP-Complete for an algorithm to be able to solve it.
I want to know if this proof is correct.
Given a graph G, find any odd cycle in G.
If you have an odd cycle that has no nodes in common with any other odd cycle, it can be easily shown to be a perfect match.
How does this prove that P=NP.
Since this is a proof by contradiction, this proof means if P=NP and P isn't NP then we would have an algorithm that solves NP-Complete problems. If that is the case then obviously P=NP because any NP-Complete problems can be written to a NP-Complete problem, thus you would have to prove that this new problem is not NP-Complete for an algorithm to be able to solve it.
I want to know if this proof is correct.