-
Notifications
You must be signed in to change notification settings - Fork 100
Star graphs and two locally isomorphic generalized Petersen graphs. #5028
New issue
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
base: develop
Are you sure you want to change the base?
Conversation
* ~bianim, ~fzne1 moved from mathboxes to main * new theorems ~fzdif1, ~fz0dif1, ~fz01pr about integer ranges in main * definition ~df-stgr of star graphs an basic theorems in AV's mathbox
* ~elunsn moved from TA's mathbox to main * new theorem ~f1ounsn in main * new theorems ~elclnbgrelnbgr, ~isubgredgss, ~isubgredg in AV's mathbox * isomorphism between closed neighborhoods and star graphs: ~isubgr3stgr and lemmas
~clnbgr3stgrgrlic added to AV's mathbox
* auxiliary theorems aboz´t generalized Petersen graphs: ~gpgorder, ~gpg5order, ~gpg5gricstgr3 * main theorem ~gpg5grlic
set.mm
Outdated
( cvv wcel csn wrex wb rexsng ax-mp ) DGHACDIJBKEABCDGFLM $. | ||
$} | ||
|
||
$( Elementhood to a union with a singleton. (Contributed by Thierry Arnoux, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
"Elementhood in a union"?
${ | ||
$d e n x $. | ||
$( Definition of star graphs according to the first definition in | ||
Wikipedia, so that ` ( StarGr `` N ) ` has size ` N ` , and order |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
"Size N and order N+1" is very confusing in my opinion, since usually "size" and "order" mean the same thing for other structures (for example, for groups these are synonyms). Maybe it's better to be more precise and say something like "... so that ( StarGr `` N ) has N+1 vertices and N edges ...".
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think the naming is precise: it is clearly defined in the glossary contained in the chapter header: https://us.metamath.org/mpeuni/mmtheorems290.html#mm28997h. And this is according to literature. So I would like not to change this.
The main result of this PR is ~gpg5grlic, showing that the two generalized Petersen graphs G(N,K) of order 10 (N = 5), which are the Petersen graph G(5,2) and the 5-prism G(5,1), are locally isomorphic. This is the first part of the (new) example to prove the existence of two graphs which are not isomorphic, but locally isomorphic, see issue #4808.
To prove the local isomorphism, star graphs are defined, and the criterion ~clnbgr3stgrgrlic (if all closed neighborhoods of the vertices in two simple graphs with the same order induce a subgraph which is isomorphic to an N-star, then the two graphs are locally isomorphic) is used. This criterion is based on the fact that if a vertex of a simple graph has exactly N (different) neighbors, and none of these neighbors are connected by an edge, then the closed neighborhood of this vertex induces a subgraph which is isomorphic to an N-star (see ~isubgr3stgr).
Besides these three main results, some auxiliary theorems (in main and my mathbox) are provided.