Minimal covers of \(S_ n\) by Abelian subgroups and maximal subsets of pairwise noncommuting elements

DOI10.1016/0097-3165(88)90057-XzbMath0666.20012MaRDI QIDQ1117036

S. H. Smith

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

symmetric groupfinite groupcover by abelian subgroupsnoncommuting elements

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Series and lattices of subgroups (20D30) Asymptotic results on counting functions for algebraic and topological structures (11N45) Subgroups of symmetric groups (20B35)

Related Items

On the Clique Numbers of Non-commuting Graphs of Certain Groups, Abelian covers of alternating groups, Centralizers in a group whose central factor is simple, Sets of permutations that generate the symmetric group pairwise., MAXIMAL SUBSETS OF PAIRWISE NONCOMMUTING ELEMENTS OF THREE-DIMENSIONAL GENERAL LINEAR GROUPS, Nilpotent covers of symmetric and alternating groups, Sets of elements that pairwise generate a linear group, Abelian coverings of finite general linear groups and an application to their non-commuting graphs., Maximal non-commuting sets in certain unipotent upper-triangular linear groups, Covering the symmetric groups with proper subgroups., Minimal covers of \(S_ n\) by abelian subgroups and maximal subsets of pairwise noncommuting elements. II

Cites Work

• Some applications of graph theory to finite groups
• The Number of Pairwise Non-Commuting Elements and the Index of the Centre in a Finite Group
• On coverings of a finite group by abelian subgroups
• The Lattice Point Covering Theorem for Rectangles
• Maximal Abelian Subgroups of the Symmetric Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item