On the clique number of the generating graph of a finite group
From MaRDI portal
Publication:3182559
DOI10.1090/S0002-9939-09-09992-4zbMath1179.05052MaRDI QIDQ3182559
Attila Maróti, Andrea Lucchini
Publication date: 9 October 2009
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Probabilistic methods in group theory (20P05)
Related Items (21)
Maximal cocliques in the generating graphs of the alternating and symmetric groups ⋮ On the connectivity of the non-generating graph ⋮ Some results on the join graph of finite groups ⋮ Generating sets of finite groups ⋮ On the generating graph of direct powers of a simple group. ⋮ The generating graph of finite soluble groups. ⋮ The diameter of the generating graph of a finite soluble group ⋮ The non-isolated vertices in the generating graph of a direct powers of simple groups. ⋮ On the maximal number of elements pairwise generating the finite alternating group ⋮ Generating graphs of finite dihedral groups ⋮ Finite groups satisfying the independence property ⋮ \(d\)-wise generation of prosolvable groups. ⋮ The independence graph of a finite group ⋮ Co-maximal graphs of two generator groups ⋮ Invariable generation with elements of coprime prime-power orders. ⋮ Graphs defined on groups ⋮ Connectivity of generating graphs of nilpotent groups ⋮ Maximal cocliques in PSL2(q) ⋮ On a special quotient of the generating graph of a finite group ⋮ On the maximal number of elements pairwise generating the symmetric group of even degree ⋮ N-critical graph of finite groups
Cites Work
- Unnamed Item
- Unnamed Item
- Some applications of the first cohomology group
- Sets of permutations that generate the symmetric group pairwise.
- Pre-Frattini groups.
- Interrelations of symplectic and orthogonal groups in characteristic two
- Crowns and factorization of the probabilistic zeta function of a finite group.
- Covering the symmetric groups with proper subgroups.
- Probabilistic generation of finite simple groups
- Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
- Groups as the union of proper subgroups.
- Intersecting families of permutations
This page was built for publication: On the clique number of the generating graph of a finite group