English

The diameter of the generating graph of a finite soluble group

Group Theory 2017-01-13 v1

Abstract

Let GG be a finite 2-generated soluble group and suppose that a1,b1=a2,b2=G\langle a_1,b_1\rangle=\langle a_2,b_2\rangle=G. If either GG^\prime is of odd order or GG^\prime is nilpotent, then there exists bGb \in G with a1,b=a2,b=G.\langle a_1,b\rangle=\langle a_2,b\rangle=G. We construct a soluble 2-generated group GG of order 210322^{10}\cdot 3^2 for which the previous result does not hold. However a weaker result is true for every finite soluble group: if a1,b1=a2,b2=G\langle a_1,b_1\rangle=\langle a_2,b_2\rangle=G, then there exist c1,c2c_1, c_2 such that a1,c1=c1,c2=c2,a2=G.\langle a_1, c_1\rangle = \langle c_1, c_2\rangle =\langle c_2, a_2\rangle=G.

Keywords

Cite

@article{arxiv.1701.03346,
  title  = {The diameter of the generating graph of a finite soluble group},
  author = {Andrea Lucchini},
  journal= {arXiv preprint arXiv:1701.03346},
  year   = {2017}
}