The non-isolated vertices in the generating graph of a direct powers of simple groups.
From MaRDI portal
Publication:1935380
DOI10.1007/s10801-012-0365-1zbMath1276.20026MaRDI QIDQ1935380
Andrea Lucchini, Eleonora Crestani
Publication date: 15 February 2013
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-012-0365-1
finite groups; 2-generator groups; diameters of graphs; direct powers of simple groups; generating graphs
20D60: Arithmetic and combinatorial problems involving abstract finite groups
20F05: Generators, relations, and presentations of groups
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
20D05: Finite simple groups and their classification
Related Items
CONNECTED COMPONENTS IN THE INVARIABLY GENERATING GRAPH OF A FINITE GROUP, The virtually generating graph of a profinite group, Maximal cocliques in the generating graphs of the alternating and symmetric groups, On the generating graph of direct powers of a simple group., The generating graph of finite soluble groups., On the connectivity of the non-generating graph, The generating graph of a profinite group, The non-commuting, non-generating graph of a nilpotent group, The diameter of the generating graph of a finite soluble group, Maximal subgroups of finite groups avoiding the elements of a generating set
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Product decompositions of quasirandom groups and a Jordan type theorem.
- Some applications of the first cohomology group
- Sets of permutations that generate the symmetric group pairwise.
- Probabilistic generation of finite simple groups. II.
- Pairwise generating and covering sporadic simple groups.
- Probabilistic generation of finite simple groups
- Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
- Sets of elements that pairwise generate a linear group
- On the clique number of the generating graph of a finite group
