On the generating graphs of symmetric groups
From MaRDI portal
Publication:721699
DOI10.1515/JGTH-2018-0004zbMATH Open1454.20066OpenAlexW2789255310MaRDI QIDQ721699FDOQ721699
Publication date: 19 July 2018
Published in: Journal of Group Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jgth-2018-0004
Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Generators, relations, and presentations of groups (20F05) Probabilistic methods in group theory (20P05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Hamilton's ideals
- Probabilistic generation of finite simple groups
- On Random Generation of the Symmetric Group
- Probabilistic generation of finite simple groups. II.
- On fixed points of permutations.
- The probability of generating the symmetric group
- Bounds for the probability of generating the symmetric and alternating groups.
- A method in graph theory
- Two-generator groups. I
- Hamiltonian cycles in the generating graphs of finite groups
- On the orders of primitive groups
- Permutations contained in transitive subgroups
- Permutations Fixing ak-set
Cited In (9)
- Independent generating sets and geometries for symmetric groups
- Title not available (Why is that?)
- 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 that?)
- The independence graph of a finite group
- INDUCING W-GRAPHS FOR SYMMETRIC GROUPS
- Title not available (Why is that?)
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)