A Cayley graph for $F_2\times F_2$ which is not minimally almost convex

Abstract

We give an example of a Cayley graph $\Gamma$ for the group $F_2\times F_2$ which is not minimally almost convex (MAC). On the other hand, the standard Cayley graph for $F_2\times F_2$ does satisfy the falsification by fellow traveler property (FFTP), which is strictly stronger. As a result, any Cayley graph property $K$ lying between FFTP and MAC (i.e., $\text{FFTP}\Rightarrow K\Rightarrow \text{MAC}$) is dependent on the generating set. This includes the well known properties FFTP and almost convexity, which were already known to depend on the generating set as well as Poénaru's condition $P(2)$ and the basepoint loop shortening property for which dependence on the generating set was previously unknown. We also show that the Cayley graph $\Gamma$ does not have the loop shortening property, so this property also depends on the generating set.

11 pages, 2 figures

References in corpus (2)

• Minimal Almost Convexity
• The loop shortening property and almost convexity

Cited by in corpus (1)

• Counting subgraphs in fftp graphs with symmetry