Transitive Graphs Uniquely Determined by Their Local Structure

@inproceedings{Tamuz2014TransitiveGU,
  title={Transitive Graphs Uniquely Determined by Their Local Structure},
  author={Omer Tamuz},
  year={2014}
}
We give an example of an infinite, vertex transitive graph that has the following property: it is the unique completion to a transitive graph of a large enough finite subgraph of itself. 

From This Paper

Figures, tables, and topics from this paper.
1 Citations
8 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Probability on tress and networks

  • Russell Lyons with Yuval Peres
  • 2015
1 Excerpt

Processes on unimodular random networks, Electronic

  • David Aldous, Russell Lyons
  • Journal of Probability
  • 2007
1 Excerpt

Automorphism groups of graphs as topological groups

  • Vladimir Trofimov
  • Matematicheskie Zametki
  • 1985
3 Excerpts

Similar Papers

Loading similar papers…