Transitive graphs uniquely determined by their local structure
From MaRDI portal
Publication:2790909
DOI10.1090/PROC/12901zbMATH Open1332.05101arXiv1411.6534OpenAlexW2128489867WikidataQ59926993 ScholiaQ59926993MaRDI QIDQ2790909FDOQ2790909
Authors: Joshua Frisch, Omer Tamuz 
Publication date: 8 March 2016
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1411.6534
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
- Recurrence of distributional limits of finite planar graphs
- Processes on unimodular random networks
- Title not available (Why is that?)
- The space of finitely generated groups
- Ergodic theory on stationary random graphs
- On the Cantor-Bendixson rank of metabelian groups.
- On the isolated points in the space of groups.
- Automorphism groups of graphs as topological 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)
