×
Gordon, L. M.

Finite simple groups with no elements of order six. (English) Zbl 0366.20007

Bull. Aust. Math. Soc. 17, 235-246 (1977).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0366.20007

Cited in 1 Review
Cited in 10 Documents

MSC:

20D05 Finite simple groups and their classification
Cite Review PDF
Full Text: DOI

References:

[1] DOI: 10.1016/0021-8693(72)90060-9 · Zbl 0246.20012 · doi:10.1016/0021-8693(72)90060-9
[2] Huppert, Endliche Gruppen I (1967) · Zbl 0217.07201 · doi:10.1007/978-3-642-64981-3
[3] DOI: 10.1016/0021-8693(65)90019-0 · doi:10.1016/0021-8693(65)90019-0
[4] DOI: 10.1016/0021-8693(65)90027-X · Zbl 0192.11902 · doi:10.1016/0021-8693(65)90027-X
[5] DOI: 10.1016/0021-8693(76)90233-7 · Zbl 0402.20012 · doi:10.1016/0021-8693(76)90233-7
[6] Gorenstein, Finite groups whose (1974) · Zbl 0201.03202
[7] Gorenstein, J. Fac. Sci. Univ. Tokyo Sect. I 16 pp 331– (1969)
[8] DOI: 10.2307/1970648 · Zbl 0184.04605 · doi:10.2307/1970648
[9] Suzuki, J. Fac. Sci. Univ. Tokyo Sect. I 6 pp 259– (1951)
[10] DOI: 10.1112/plms/s3-26.4.653 · Zbl 0259.20014 · doi:10.1112/plms/s3-26.4.653
[11] Gorenstein, Finite groups (1968)
[12] DOI: 10.2307/1997169 · Zbl 0312.20009 · doi:10.2307/1997169
[13] DOI: 10.2307/1997168 · Zbl 0312.20008 · doi:10.2307/1997168
[14] DOI: 10.1016/0021-8693(74)90172-0 · Zbl 0287.20010 · doi:10.1016/0021-8693(74)90172-0
[15] DOI: 10.2307/2035202 · Zbl 0151.02002 · doi:10.2307/2035202
[16] DOI: 10.2307/1995627 · Zbl 0222.20002 · doi:10.2307/1995627
[17] DOI: 10.1112/plms/s3-25.2.213 · Zbl 0243.20011 · doi:10.1112/plms/s3-25.2.213
[18] DOI: 10.1016/0021-8693(65)90015-3 · Zbl 0192.12001 · doi:10.1016/0021-8693(65)90015-3
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.