3 research outputs found
Two graph isomorphism polytopes
The convex hull of certain tensors was considered
recently in connection with graph isomorphism. We consider the convex hull
of the diagonals among these tensors. We show: 1. The polytope
is a face of . 2. Deciding if a graph has a subgraph
isomorphic to reduces to optimization over . 3. Optimization over
reduces to optimization over . In particular, this implies
that the subgraph isomorphism problem reduces to optimization over