A Family of Counter Examples to an Approach to Graph Isomorphism
Abstract
We give a family of counter examples showing that the two sequences of polytopes n,n and n,n are different. These polytopes were defined recently by S. Friedland in an attempt at a polynomial time algorithm for graph isomorphism.
0