Graphs and separability properties of groups (Q1355505)

The author starts the study of separability properties of groups by using graph methods. A group \(G\) is called LERF (locally extended residually finite) if for any finitely generated subgroup \(S\) of \(G\) and any element \(g\in G\) not in \(S\), there exists a subgroup \(S_0\) of finite index in \(G\) containing \(S\) but not \(g\). The main result of the paper is that a free product of a free group and a LERF group amalgamated over a cyclic subgroup maximal in the free factor is LERF. She also gives short proofs of some old results including the theorem that a free product of free groups, amalgamated over a cyclic subgroup, is LERF. The method is by transferring to properties of a Cayley graph of a presentation and a relative Cayley graph with respect to a subgroup and then by using the notions of a cover of the graph \(G\) and \(G\)-based graphs.