Hamiltonian cycles in the generating graphs of finite groups

DOI10.1112/blms/bdq017zbMath1223.20058MaRDI QIDQ3581214

Thomas Breuer, Attila Maróti, Gábor P. Nagy, Robert M. Guralnick, Andrea Lucchini

Publication date: 16 August 2010

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/bdq017

zbMATH Keywords

symmetric groups; finite simple groups; Hamiltonian cycles; generating graphs of finite groups

Mathematics Subject Classification ID

20D60: Arithmetic and combinatorial problems involving abstract finite groups

20F05: Generators, relations, and presentations of groups

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

20D06: Simple groups: alternating groups and groups of Lie type

05C45: Eulerian and Hamiltonian graphs

20P05: Probabilistic methods in group theory

Related Items

Generating sets of finite groups, ALTERNATING AND SYMMETRIC GROUPS WITH EULERIAN GENERATING GRAPH, Unnamed Item, Finite groups with planar generating graph, On the uniform domination number of a finite simple group, Maximal cocliques in PSL₂(q), Co-maximal graphs of two generator groups, Some results on the join graph of finite groups, A few remarks on the theory of non-nilpotent graphs, On the generating graph of direct powers of a simple group., The generating graph of finite soluble groups., Crosscap of the non-cyclic graph of groups, The generating graph of some monolithic groups., On the generating graphs of symmetric groups, Connectivity of generating graphs of nilpotent groups, Forbidden subgraphs in generating graphs of finite groups, Finite groups, 2-generation and the uniform domination number, The independence graph of a finite group, On the uniform spread of almost simple symplectic and orthogonal groups, Genus, thickness and crossing number of graphs encoding the generating properties of finite groups

Uses Software

• GAP