Can graph isomorphism be solved in polynomial time?
Research level
Given two graphs on vertices, decide whether they are isomorphic, that is, whether some relabeling of the vertices of one turns it into the other. Is there an algorithm that does this in time polynomial in ?