The graph of the generating \(d\)-tuples of a finite soluble group and the swap conjecture.

DOI10.1016/j.jalgebra.2012.11.026zbMath1287.20024OpenAlexW1979737482WikidataQ123119039 ScholiaQ123119039MaRDI QIDQ360161

Andrea Lucchini, Eleonora Crestani

Publication date: 26 August 2013

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0021869312005832

zbMATH Keywords

finite groupsfinite soluble groupsconnectivitynumbers of generatorsswap conjectureproduct replacement algorithmgraphs of generating tuplesT-systems

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (3)

The swap graph of the finite soluble groups ⋮ Finite soluble groups satisfying the swap conjecture. ⋮ The independence graph of a finite group

This page was built for publication: The graph of the generating \(d\)-tuples of a finite soluble group and the swap conjecture.