On the generating graphs of symmetric groups
From MaRDI portal
Publication:721699
Recommendations
Cites Work
- scientific article; zbMATH DE number 5150116 (Why is no real title available?)
- scientific article; zbMATH DE number 3186565 (Why is no real title available?)
- A method in graph theory
- Bounds for the probability of generating the symmetric and alternating groups.
- Hamiltonian cycles in the generating graphs of finite groups.
- On Hamilton's ideals
- On Random Generation of the Symmetric Group
- On fixed points of permutations.
- On the orders of primitive groups
- Permutations Fixing ak-set
- Permutations contained in transitive subgroups
- Probabilistic generation of finite simple groups
- Probabilistic generation of finite simple groups. II.
- The probability of generating the symmetric group
- Two-generator groups. I
Cited In (11)
- Independent generating sets and geometries for symmetric groups
- Hamiltonian cycles in the generating graphs of finite groups.
- Title not available (Why is no real title available?)
- Some groups related to the symmetry of a directed graph
- A few remarks on the theory of non-nilpotent graphs
- On the maximal number of elements pairwise generating the symmetric group of even degree
- Title not available (Why is no real title available?)
- Alternating and symmetric groups with Eulerian generating graph
- The independence graph of a finite group
- INDUCING W-GRAPHS FOR SYMMETRIC GROUPS
- Title not available (Why is no real title available?)
This page was built for publication: On the generating graphs of symmetric groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721699)