Transitive graphs uniquely determined by their local structure
classification
🧮 math.GR
math.MG
keywords
graphtransitivecompletiondeterminedenoughfinitefollowinggrandfather
read the original abstract
We show that the "grandfather graph" has the following property: it is the unique completion to a transitive graph of a large enough finite subgraph of itself.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.