2000 character limit reached
A Family of Counter Examples to an Approach to Graph Isomorphism
Published 11 Jan 2008 in cs.CC and cs.DM | (0801.1766v2)
Abstract: We give a family of counter examples showing that the two sequences of polytopes $\Phi_{n,n}$ and $\Psi_{n,n}$ are different. These polytopes were defined recently by S. Friedland in an attempt at a polynomial time algorithm for graph isomorphism.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
