Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/wiley/hamiltonian-cycles-in-the-generating-graphs-of-finite-groups-0DJlD9RjzW
References (26)
-
R. Guralnick, A. Shalev (2003)
On the Spread of Finite Simple GroupsCombinatorica, 23
-
D. Segal, A. Shalev (1999)
On groups with bounded conjugacy classesQuarterly Journal of Mathematics, 50
-
P. Neumann, M. Vaughan-Lee (1977)
An Essay on BFC GroupsProceedings of The London Mathematical Society
-
A. Matsuo, K. Nagatomo, A. Tsuchiya (2005)
Quasi-finite algebras graded by Hamiltonian and vertex operator algebrasarXiv: Quantum Algebra
-
A. Lucchini, A. Maróti (2009)
Some results and questions related to the generating graph of a finite group -
L. Lovász (1979)
Combinatorial problems and exercises -
(1967)
Endliche Gruppen. I, Die Grundlehren der Mathematischen Wissenschaften -
A. Lucchini, A. Maróti (2009)
On finite simple groups and Kneser graphsJournal of Algebraic Combinatorics, 30
-
Including archive of solved problems -
T. Breuer, R. Guralnick, W. Kantor (2000)
Probabilistic generation of finite simple groups, IIJournal of Algebra, 320
-
I. Isaacs, T. Keller, U. Meierfrankenfeld, A. Moretó (2006)
Fixed point spaces, primitive character degrees and conjugacy class sizes, 134
-
R. Wilson (2010)
Moonshine: The First Quarter Century and Beyond: New computations in the Monster -
PSL(2,47) : C2: Chvatal for 0th closure, Posa for 1st closure -
Tomasz Łuczak, L. Pyber (1993)
On Random Generation of the Symmetric GroupCombinatorics, Probability and Computing, 2
-
T. Breuer (2007)
GAP Computations Concerning Probabilistic Generation of Finite Simple GroupsarXiv: Representation Theory
-
(2010)
and R -
M. Liebeck, A. Shalev (1996)
Simple Groups, Probabilistic Methods, and a Conjecture of Kantor and LubotzkyJournal of Algebra, 184
-
J. Bondy, V. Chvátal (1976)
A method in graph theoryDiscret. Math., 15
-
A. Lucchini, A. Maróti (2009)
On the clique number of the generating graph of a finite group, 137
-
R. Guralnick, W. Kantor (2000)
Probabilistic Generation of Finite Simple Groups -
P. Kleidman, M. Liebeck (1990)
The Subgroup Structure of the Finite Classical Groups -
Thomas Hayes (2006)
The probability of generating the symmetric group when one of the generators is randomPublicationes Mathematicae Debrecen
-
(2005)
GAP-groups, algorithms and programming -
D. Johnson (1983)
The Kourovka notebook : unsolved problems in group theory -
Jason Fulman, R. Guralnick (2009)
Bounds on the number and sizes of conjugacy classes in finite Chevalley groups with applications to derangementsTransactions of the American Mathematical Society, 364
-
M. Aschbacher (1994)
Finite Group Theory
- Publisher
- Wiley
- Copyright
- © London Mathematical Society
- ISSN
- 0024-6093
- eISSN
- 1469-2120
- DOI
- 10.1112/blms/bdq017
- Publisher site
- See Article on Publisher Site
Abstract
For a finite group G let Γ(G) denote the graph defined on the non‐identity elements of G in such a way that two distinct vertices are connected by an edge if and only if they generate G. In this paper it is shown that the graph Γ(G) contains a Hamiltonian cycle for many finite groups G.
Journal
Bulletin of the London Mathematical Society – Wiley
Published: Aug 1, 2010