Repeat: If graph isomorphism is NP-complete, the polynomial time hierarchy collapses to its second level.
If graph isomorphism is NP-complete, the polynomial time hierarchy collapses to its second level.