Graphs being locally isomorphic but not isomorphic (2) #4990
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Unfortunately, the example which I have chosen does not work. The two graphs are also not locally isomorphic, see theorem ~usgrexmpl12ngrlic in this PR! The graphs consisting of 6 vertices and 7 edges are too small, I thing 8 vertices and 9 edges are required (the example graphs in MathOverflow have 10 vertices and 11 edges. The brute force methods I used to prove the corresponding theorems will not be feasible anymore for such graphs, so more general concepts (cycles of 4 edges, unions of graphs, k-stars, etc.) must be studied. I think we have to put issue #4808 on hold now...
Details of this PR:
H
andG
are not locally isomorphic: ~usgrexmpl12ngrlic