On the generating graphs of symmetric groups

DOI10.1515/jgth-2018-0004zbMath1454.20066OpenAlexW2789255310MaRDI QIDQ721699

Fuat Erdem

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

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45) Probabilistic methods in group theory (20P05)

Related Items (2)

A few remarks on the theory of non-nilpotent graphs ⋮ The independence graph of a finite group

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds for the probability of generating the symmetric and alternating groups.
• Probabilistic generation of finite simple groups. II.
• On fixed points of permutations.
• Two-generator groups. I
• A method in graph theory
• Probabilistic generation of finite simple groups
• On the orders of primitive groups
• On Hamilton's ideals
• Permutations contained in transitive subgroups
• Hamiltonian cycles in the generating graphs of finite groups
• On Random Generation of the Symmetric Group
• Permutations Fixing ak-set
• The probability of generating the symmetric group

This page was built for publication: On the generating graphs of symmetric groups