Finite groups whose subgroup graph contains a vertex of large degree
The paper under review studies finite groups whose subgroup graph \(L(G)^{*}\) contains a vertex of degree strictly greater than \(|G|/2 - 1\), extending a result by \textit{T. C. Burness} and \textit{S. D. Scott} [J. Aust. Math. Soc. 87, No. 3, 329--357 (2009; Zbl 1191.20015)] on the number of prime order subgroups and generalizing the classification of groups with many involutions by \textit{C. T. C. Wall} [Proc. Camb. Philos. Soc. 67, 251--262 (1970; Zbl 0197.30201)].\N\NThe main theorem classifies all finite solvable groups with this property. These include: (1) various finite groups of small order; (2) the families identified by Burness and Scott [loc. cit.] and by Wall [loc. cit.]; (3) elementary abelian \(2\)-groups and certain generalized extraspecial \(2\)-groups; (4) explicit constructions involving central products and split extensions.\N\NLet \(L(G)^{*}\) denote the undirected graph whose vertices are the subgroups of \(G\). Two distinct subgroups \(H_1, H_2 \le G\) are joined by an edge in \(L(G)^*\) if one is properly contained in the other and there exists no subgroup of \(G\) that lies strictly between them. That is, \(H_1\) and \(H_2\) are adjacent if \(H_1 < H_2\) or \(H_2 < H_1\), and there does not exist a subgroup \(K\) of \(G\) such that \(H_1 < K < H_2\) or \(H_2 < K < H_1\). For a subgroup \(H \le G\), the degree \(d_{L(G)^*}(H)\) denotes the number of edges in \(L(G)^*\) incident to \(H\).\N\NThe author employs a combination of lattice-theoretic techniques and quantitative bounds on maximal subgroups due to \textit{G. E. Wall} [J. Aust. Math. Soc. 2, 35--59 (1961; Zbl 0121.27302)], \textit{R. J. Cook} et al. [J. Aust. Math. Soc., Ser. A 43, 220--223 (1987; Zbl 0625.20016)], \textit{M. Herzog} and \textit{O. Manz} [J. Aust. Math. Soc., Ser. A 58, No. 1, 134--141 (1995; Zbl 0831.20030)], and \textit{B. Newton} [Arch. Math. 96, No. 6, 501--506 (2011; Zbl 1235.20029)]. A central lemma establishes the inequality\N\[\Nd_{L(G)^*}(H) \le d + \frac{|G|}{d} - 2\N\]\Nfor any subgroup \(H \le G\) of order \(d\), which is crucial for the classification.
- Almost all generalized extraspecial \(p\)-groups are resistant
- Finite group theory.
- Finite groups with planar subgroup lattices.
- Graphs defined on groups
- scientific article; zbMATH DE number 4014981 (Why is no real title available?)
- scientific article; zbMATH DE number 777663 (Why is no real title available?)
- scientific article; zbMATH DE number 3314393 (Why is no real title available?)
- On the number of edges of cyclic subgroup graphs of finite groups
- On the number of maximal subgroups of a finite solvable group.
- ON THE NUMBER OF PRIME ORDER SUBGROUPS OF FINITE GROUPS
- Planar groups
- Planar subgroup lattices.
- Some applications of the Eulerian functions of a finite group
- The Dade group of (almost) extraspecial \(p\)-groups.
- The genus of the subgroup graph of a finite group
This page was built for publication: Finite groups whose subgroup graph contains a vertex of large degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6996146)
