We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
As far as I can tell, graph isomorphism is claimed to be symmetric without proof.
As far as I can tell, graph isomorphism is not claimed to be reflexive or transitive.
I suspect that there should be proofs that graph isomorphism is indeed symmetric, reflexive, and transitive.
The text was updated successfully, but these errors were encountered:
You are right. We plan to add these and a few other proofs for the next release.
In the mean time we encourage you to ask for all the details (proofs) you would be interested in.
Thank you for your comments.
Sorry, something went wrong.
No branches or pull requests
As far as I can tell, graph isomorphism is claimed to be symmetric without proof.
As far as I can tell, graph isomorphism is not claimed to be reflexive or transitive.
I suspect that there should be proofs that graph isomorphism is indeed symmetric, reflexive, and transitive.
The text was updated successfully, but these errors were encountered: