The virtually generating graph of a profinite group
Abstract
We consider the graph whose vertices are the elements of a finitely generated profinite group and where two vertices and are adjacent if and only if they topologically generate an open subgroup of . We investigate the connectivity of the graph obtained from by removing its isolated vertices. In particular we prove that for every positive integer , there exists a finitely generated prosoluble group with the property that has precisely connected components. Moreover we study the graph , whose vertices are again the elements of and where two vertices are adjacent if and only if there exists a minimal generating set of containing them. In this case we prove that the subgraph obtained removing the isolated vertices is connected and has diameter at most 3.
Cite
@article{arxiv.2007.12478,
title = {The virtually generating graph of a profinite group},
author = {Andrea Lucchini},
journal= {arXiv preprint arXiv:2007.12478},
year = {2023}
}