Matroids and isomorphism problems for Bestvina-Brady groups

RESUMO

We propose a factorization of the graph isomorphism problem for Bestvina-Brady groups (BBGs) through matroid theory. In particular, we show that finitely presented BBGs depend on their defining graphs only through their cycle matroids. On the other hand, we construct graphs of arbitrarily high connectivity such that they have non-isomorphic cycle matroids but their BBGs are isomorphic. To do so, we prove that if a graph admits a tree clique-spanner, then the Dicks-Leary presentation of its BBG can be explicitly simplified to a right-angled Artin group presentation. In particular, we show that BBGs defined by dually chordal graphs are right-angled Artin groups.