\input zb-basic
\input zb-ioport
\iteman{io-port 06076529}
\itemau{Tim\'ar, \'Ad\'am}
\itemti{Approximating Cayley diagrams versus Cayley graphs.}
\itemso{Comb. Probab. Comput. 21, No. 4, 635-641 (2012).}
\itemab
Summary: We construct a sequence of finite 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 Hamiltonian cycle in one of them has a limit that is not approximable by any subgraph of the other. We give an example where this holds, but convergence is meant in a stronger sense. This is related to whether having a Hamiltonian cycle is a testable graph property.
\itemrv{~}
\itemcc{}
\itemut{Hamiltonian cycle; graph sequences}
\itemli{doi:10.1017/S0963548311000733}
\end