Zurück zur Übersicht

Approximating Cayley graphs versus Cayley diagrams

Publikationsart Peer-reviewed
Publikationsform Originalbeitrag (peer-reviewed)
Publikationsdatum 2012
Autor/in Adam Timar,
Projekt Groupes sofiques: algèbre, analyse et dynamique
Alle Daten anzeigen

Originalbeitrag (peer-reviewed)

Zeitschrift Combinatorics, probability and computing
Volume (Issue) 21
Seite(n) 635 - 641
Titel der Proceedings Combinatorics, probability and computing

Open Access

OA-Form Repositorium (Green Open Access)


We construct a sequence of nite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that converge to the same limit, and such that a spanning tree in one of them has a limit that is not approximable by any subgraph of the other. We give an example where this subtree is a Hamiltonian cycle, but convergence is meant in a stronger sense. These latter are related to whether having a Hamiltonian cycle is a testable graph property.