Regular saturated formations of finite soluble groups (Q6908149)

One of the classic methods of studying the structure of a finite group is the graph method, which establishes a connection between the characteristics of a finite group and the graph associated with it. Among the different approaches to associate a graph with a finite group, the constructions of \(\mathcal{F}\)-graphs and non-\(\mathcal{F}\)-graphs are relevant. Their main idea is that two elements \(x\) and \(y\) are connected by an edge if \(\langle x,y\rangle \in \mathcal{F}\) for \(\mathcal{F}\)-graphs and \(\langle x,y\rangle \notin\mathcal{F}\) for non-\(\mathcal{F}\)-graphs. A hereditary formation \(\mathcal{F}\) is said to be regular if the set of all isolated vertices of the described graph coincides with the intersection of all \(\mathcal{F}\)-maximal subgroups in every group.\N\NThe aim of the paper under review is to improve the description of saturated regular formations of finite soluble groups and present new ways of constructing them. On the one hand, the authors show that saturated regular non-empty formations of finite soluble groups are just hereditary formations \(\mathcal{F}\) of soluble groups that contain every finite group whose cyclic primary subgroups are all K-\(\mathcal{F}\)-subnormal. Also, they prove that the lattice of saturated regular formations of finite soluble groups is isomorphic to the Steinitz lattice. In addition, they propose some open questions that naturally arise from the results.