Transitive graphs uniquely determined by their local structure
From MaRDI portal
Publication:2790909
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.
Recommendations
- Locally \(s\)-transitive graphs
- A characterization of locally finite vertex-transitive graphs
- Locally finite, planar, edge-transitive graphs
- Locally \(s\)-distance transitive graphs
- scientific article; zbMATH DE number 4077280
- scientific article; zbMATH DE number 524155
- The transitivity of special graph classes
- Strongly adjacency-transitive graphs and uniquely shift-transitive graphs
- A new class of transitive graphs
- Analysing finite locally 𝑠-arc transitive graphs
Cites work
- scientific article; zbMATH DE number 2042286 (Why is no real title available?)
- Automorphism groups of graphs as topological groups
- Ergodic theory on stationary random graphs
- On the Cantor-Bendixson rank of metabelian groups.
- On the isolated points in the space of groups.
- Processes on unimodular random networks
- Recurrence of distributional limits of finite planar graphs
- The space of finitely generated groups
Cited in
(5)
This page was built for publication: Transitive graphs uniquely determined by their local structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790909)