Wei, X.; Zhurtov, A. Kh.; Lytkina, D. V.; Mazurov, V. D. Finite groups close to Frobenius groups. (English. Russian original) Zbl 1516.20042 Sib. Math. J. 60, No. 5, 805-809 (2019); translation from Sib. Mat. Zh. 60, No. 5, 1035-1040 (2019). Summary: We study finite nonsoluble generalized Frobenius groups; i.e., the groups \(G\) with a proper nontrivial normal subgroup \(F\) such that each coset \(Fx\) of prime order \(p,\) as an element of the quotient group \(G/F\), consists only of \(p\)-elements. The particular example of such a group is a Frobenius group, given that \(F\) is the Frobenius kernel of \(G\), and also the Camina group. Cited in 2 Documents MSC: 20D25 Special subgroups (Frattini, Fitting, etc.) 20D15 Finite nilpotent groups, \(p\)-groups Keywords:Frobenius group; generalized Frobenius group; kernel; complement; Camina group PDFBibTeX XMLCite \textit{X. Wei} et al., Sib. Math. J. 60, No. 5, 805--809 (2019; Zbl 1516.20042); translation from Sib. Mat. Zh. 60, No. 5, 1035--1040 (2019) Full Text: DOI References: [1] Camina A. R., “Some conditions which almost characterize Frobenius groups,” Israel J. Math., vol. 31, no. 2, 153-160 (1978). · Zbl 0654.20019 [2] Lewis, M. L.; Sastry, N. S N. (ed.); Yadav, M. K (ed.), Camina groups, Camina pairs, and generalization, 141-174 (2018), Singapore [3] Huppert B., Endliche Gruppen. I, Springer-Verlag, Berlin, Heidelberg, and New York (1978). · Zbl 0217.07201 [4] Huppert B. and Blackburn N., Finite Groups. III, Springer-Verlag, Berlin and Heidelberg (1982). · Zbl 0514.20002 [5] Fleischmann P., Lempken W., and Tiep P. H., “Finite p’-semiregular groups,” J. Algebra, vol. 188, no. 2, 547-579 (1997). · Zbl 0896.20007 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.