Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability

David E. Roberson, Tim Seppelt

We show that feasibility of the $t^{\text{th}}$ level of the Lasserre semidefinite programming hierarchy for graph isomorphism can be expressed as a homomorphism indistinguishability…