On the connectivity of the generating and rank graphs of finite groups
From MaRDI portal
Publication:6667404
DOI10.1016/j.jalgebra.2024.10.030MaRDI QIDQ6667404
Andrea Lucchini, Daniele Nemmi
Publication date: 20 January 2025
Published in: Journal of Algebra (Search for Journal in Brave)
Could not fetch data.
Special aspects of infinite or finite groups (20Fxx) Abstract finite groups (20Dxx) Probabilistic methods in group theory (20Pxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The generating graph of finite soluble groups.
- On the probability of generating finite groups with a unique minimal normal subgroup.
- Probabilistic generation of finite simple groups. II.
- Pre-Frattini groups.
- On complemented nonabelian chief factors of a finite group
- Generators for finite groups with a unique minimal normal subgroup
- Crowns and factorization of the probabilistic zeta function of a finite group.
- Probabilistic generation of finite simple groups
- The probability of generating a finite simple group
- Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
- The non-isolated vertices in the generating graph of a direct powers of simple groups.
- The diameter of the generating graph of a finite soluble group
- The probability of generating a finite classical group
- The spread of a finite group
- Probabilistic generation of finite groups with a unique minimal normal subgroup.
- Zu einem von B. H. und H. Neumann gestellten Problem
- Generators for Simple Groups
- The Spread of Almost Simple Classical Groups
- Classes of Finite Groups
- The probability of generating the symmetric group
- Simple Groups, Generation and Probabilistic Methods
- Probabilistic generation of finite almost simple groups
This page was built for publication: On the connectivity of the generating and rank graphs of finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6667404)
