REVIEW 2 major objections 4 minor 25 references
Finite groups with planar generating graph
T0 review · 2 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read A finite 2-generated group has a planar generating graph exactly when it is one of eleven groups.
desk verdict A clean classification, but the necessity proof has a real gap: the final case wrongly asserts α_j≥2 for lower chief factors, and C2×A4 shows the claim is false. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The workhorse is the ratio $\alpha(G,N)=\frac{e(G)/|G|}{e(G/N)/|G/N|}$ for a minimal normal subgroup $N$, equal to $|N|P_{G,N}(2)$, the conditional probability that two random elements generate $G$ given that they generate $G/N$. Along a chief series these factors multiply to $|G|P_G(2)$, twice the expected edge count per vertex. Lemma 4, built on the formula $P_{G,N}(2)=1-c/p^{2a}$, says the factor is $1$, $\frac32$, or at least $2$, with the small values reserved for order-2 complemented chief factors. Comparing the product of these factors with the planar edge bound $3n-6$ is what shrinks the universe of possible groups to a finite list, after which explicit drawings finish the proof.
What would settle it
Construct the generating graph of the dicyclic group of order 12, the non-dihedral group with a normal $C_3$ and a $C_2\times C_2$ quotient, and check whether it is planar. The proof excludes this group only through the assertion that such a group is $D_6$, so a planar drawing of its graph would refute the classification, while a $K_5$ or $K_{3,3}$ subdivision would show that the final-case argument needs to identify that case explicitly.
Extended reading notes
Core claim
The central claim is the bi-conditional: if $G$ is a finite 2-generated group, then $\Gamma(G)$ is planar if and only if $G$ belongs to the eleven-element list $C_2, C_3, C_4, C_5, C_6, C_2\times C_2, D_3, D_4, Q_8, C_4\times C_2, D_6$. The proof splits into a universal exclusion and an explicit exhibition. The exclusion starts from the planar edge bound $e\le 3|G|-6$, which forces the product of chief-series ratios $\alpha_i$ to be less than 6, and shows via the ratio lemmas that this can only happen for groups built from very small chief factors; the surviving candidates are then eliminated one by one, except for the listed groups, whose generating graphs are drawn in the plane. Since the listed graphs are planar by construction, the classification is complete if every borderline case in the final count is genuinely excluded.
Load-bearing premise
Two load-bearing assertions carry the final exclusion: that a chief factor of order 2 with no $C_2$ quotient above it contributes a factor at least 2, where the ratio lemma only guarantees $\frac32$, and that the only order-12 group with a noncentral normal $C_3$ and a $C_2\times C_2$ quotient is $D_6$. If either admits another case, the classification could be incomplete.
Editorial extensions
If this is right
- Any finite 2-generated group outside the eleven-group list has a generating graph that is nonplanar, hence contains a $K_5$ or $K_{3,3}$ subdivision.
- For the eleven groups, planarity can be certified by explicit drawings; the non-cyclic order-8 cases $D_4$, $Q_8$, and $C_4\times C_2$ have isomorphic planar skeletons after isolated vertices are deleted.
- The inequality $|G|P_G(2)<6$ becomes a necessary test: any group with two-element generation probability above $6/|G|$ cannot have a planar generating graph.
- The proof reduces a global geometric question to finitely many chief-series computations, so the planarity of $\Gamma(G)$ is decidable for any given finite 2-generated group by checking a short list.
Reading between the lines
- The same chief-series ratio technique should classify other sparse graph properties of generating graphs, such as bounded genus or bounded treewidth, by substituting the appropriate edge bound for $3n-6$; the paper's structure already delivers the needed product formula.
- A computer search over 2-generated groups of small order could test the borderline cases directly, checking whether any group outside the eleven-list has a planar generating graph and thereby sharpening or confirming the final-case analysis.
- The dependency on the conditional probability $P_{G,N}(2)$ suggests a probabilistic reading of planarity: only groups whose two-element generation probability decays slowly relative to group order can afford the low edge counts that planarity permits.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper classifies the finite 2-generated groups whose generating graph Γ(G) is planar. The main theorem asserts that Γ(G) is planar exactly for the eleven groups C2, C3, C4, C5, C6, C2×C2, D3, D4, Q8, C4×C2, and D6. The proof combines the planar edge bound |E| ≤ 3|V|−6 with probabilistic generation: writing P_G(2) as a product over chief factors, the author defines α_i = |N_{i-1}/N_i| P_{G/N_i, N_{i-1}/N_i}(2) and derives the bound ∏ α_i < 6 from planarity. Lemmas 2–4 give lower bounds on α for nonabelian and abelian chief factors, leading to solubility of any planar-generating 2-generated group. The remaining case analysis handles cyclic groups of order at least 7, groups admitting a C2×C2 quotient, and groups without one; the 'if' direction is established by explicit planar drawings for the listed groups.
Significance. If the proof gap identified below is repaired, the theorem gives a complete, elegant classification of a natural graph invariant of finite groups. The strategy of passing from planarity to the ratio e(G)/|G| and then to chief-series factors is attractive and likely to be reusable. The paper explicitly exhibits planar drawings for all eleven groups, and the main impossibility argument is a clean application of Gaschütz's and Detomi–Lucchini's probabilistic generation results. Those results concern generation probabilities, not planarity, so the classification is not circularly dependent on the conclusion. The principal weakness is a nontrivial missing case in the final paragraph of Section 3; the theorem may well be true, but the printed derivation is incomplete.
major comments (2)
- [Section 3, final paragraph] The assertion "α_j ≥ 2 if j > 1" in the final case (where C2×C2 is not an epimorphic image of G) is not a consequence of Lemma 4. Lemma 4(2) explicitly allows α = 3/2 for an order-2 chief factor N when N has a complement in G/N_j and G/N_j has no epimorphic image of order 2. Such a factor can occur below an odd chief factor without giving a C2×C2 quotient of G. A concrete witness is G = C2×A4: it is 2-generated, has no C2×C2 quotient, and a chief series with factors C3, V4, C2; for the bottom C2 factor, the complement A4 exists and A4 has no C2 quotient, so Lemma 4(2) gives α = 3/2. Consequently the deduction "By (3.2), we must have t ≤ 2" is invalid, and the printed proof does not exclude the possibility of t ≥ 3 in this case.
- [Section 3, final paragraph] Related to the previous comment, the conclusion "By Lemma 4, |N1| ≤ 4" and the subsequent list of remaining possibilities (C3×C3, Alt(4), D3) depend on the invalid t ≤ 2 step. A group such as C2×A4 has a chief series of length 3 and no C2×C2 quotient, so it is not covered by the case analysis as written. The author must either prove that α_j ≥ 2 for j > 1 under an additional hypothesis that holds in this case, or supply a different argument that handles lower order-2 chief factors with a complement and no C2 quotient.
minor comments (4)
- [Section 3, opening paragraph] In the sentence "let e(G) be the number of vertices of the generating graph", the word "vertices" should be "edges"; the subsequent formula e(G) = |G|^2 P_G(2)/2 is for edges.
- [Section 3, C2×C2 quotient subcase] The expression "α3 ≥ 2 if j > 2" contains an index typo; it should read "α_j ≥ 2 if j > 2".
- [Lemma 4, proof] The claim that 2-generation of G forces H/K ≅ 1 or C2 is not immediate; H/K is an elementary abelian 2-group generated by at most two elements, so in principle H/K could be V4. The missing argument is that V4 would give c = 4 and hence P_{G,N}(2) = 0, contradicting the assumption that G is 2-generated.
- [Section 2, Lemma 2] The notation g^n for conjugation is used without explicit definition; it would help to state that g^n = n^{-1} g n, although the displayed equation with commutators makes the intended meaning clear.
Circularity Check
No significant circularity: the proof is a self-contained deduction from independent probabilistic-generation results.
full rationale
The paper derives the planarity classification from general lower bounds on the number of edges of the generating graph. The key inputs are Gaschütz's theorem (Satz 2 in [7]) for the conditional generation probability, and Detomi–Lucchini's theorems [4, Theorem 17] and [5, Theorem 1.1] bounding a related probability from below. Although the latter are self-citations, they are independent, parameter-free results about probabilistic generation of finite groups; they do not mention planarity and do not encode the classification being proved. The same applies to the classical Kuratowski-type edge bound from Bondy–Murty. No parameter is fitted, no quantity is defined in terms of the target planarity property, and no 'prediction' is merely a renamed input. The possible gap noted in the proof (the assertion alpha_j ≥ 2 in the last case of Section 3, which Lemma 4(2) does not justify) is a correctness or completeness concern, not circularity: it does not involve the paper's conclusion being assumed as an input. Therefore the circularity score is 0.
Assumptions & free parameters
assumptions (8)
- standard math A planar graph with n >= 3 vertices has at most 3n - 6 edges.
- domain assumption Gaschütz's theorem: lifting a generating tuple modulo N, the number of tuples in N that generate G does not depend on the chosen lifts, so P_G(k) = P_{G/N}(k)P_{G,N}(k).
- domain assumption Gaschütz's Satz 2: for abelian minimal normal N, P_{G,N}(2) = 1 - c/p^{2a}, where c is the number of complements.
- domain assumption Detomi-Lucchini [4, Theorem 17]: for nonabelian minimal normal N with soluble quotient, P_{G,N}(2) coincides with the probability in G/C_G(N) acting on NC_G(N)/C_G(N).
- domain assumption Detomi-Lucchini [5, Theorem 1.1] gives the lower bound 53/90 for the relevant generation probability.
- standard math In a chief series, iterating the probability factorization gives product of alpha_i = |G| P_G(2).
- domain assumption The small-group facts used without proof: every non-cyclic group of order 8 has Delta(G) isomorphic to K6 minus a perfect matching, and the order-12 groups with a noncentral normal C3 and quotient C2×C2 are not exhausted by D6.
- standard math phi(n) >= 4 for every n >= 7.
Cite this review
Pith. "Pith review of Finite groups with planar generating graph." pith.science (2026). https://pith.science/paper/EE3YKNFX
@misc{pith2026190801649,
author = {Pith},
title = {Pith review of: Finite groups with planar generating graph},
year = {2026},
howpublished = {\url{https://pith.science/paper/EE3YKNFX}},
note = {Machine review of arXiv:1908.01649}
}
abstract
Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated finite group. We prove that $\Gamma(G)$ is planar if and only if $G$ is isomorphic to one of the following groups: $C_2, C_3, C_4, C_5, C_6, C_2 \times C_2, D_3, D_4, Q_8, C_4\times C_2, D_6.$
Reference graph
Works this paper leans on
-
[1]
M. Aschbacher and R. Guralnick, Some applications of the first cohomology group. J. Algebra 90 (1984), 446--460
work page 1984
-
[2]
J. A. Bondy and U. S. R. Murty, Graph theory, Graduate Texts in Mathematics, 244. Springer, New York, 2008
work page 2008
- [3]
- [4]
- [5]
- [6]
-
[7]
T. Burness and E. Crestani, On the generating graph of direct powers of a simple group, J. Algebraic Combin. 38 (2013), no. 2, 329--350
work page 2013
-
[8]
P. Cameron, A. Lucchini and C. Roney-Dougal, Generating sets of finite groups, Trans. Amer. Math. Soc. to appear
Show all 25 references
-
[9]
Crestani and A
E. Crestani and A. Lucchini, d -Wise generation of prosolvable groups,
-
[10]
Crestani and A
E. Crestani and A. Lucchini, The generating graph of finite soluble groups. Israel J. Math. 198 (2013), no. 1, 63--74
2013
-
[11]
Crestani and A
E. Crestani and A. Lucchini, The graph of the generating
-
[12]
Crestani and A
E. Crestani and A. Lucchini, The non-isolated vertices in the generating graph of a direct powers of simple groups, J. Algebraic Combin. 37 (2013), no. 2, 249--263
2013
-
[13]
Dalla Volta and A
F. Dalla Volta and A. Lucchini, Finite groups that need more generators than any proper quotient, J. Austral. Math. Soc. Ser. A 64 (1998), no. 1, 82--91
1998
-
[14]
Damian and A
E. Damian and A. Lucchini, The Dirichlet polynomial of a finite group and the subgroups of prime power index, Advances in group theory 2002, 209--221, Aracne, Rome, 2003
2002
-
[15]
Detomi and A
E. Detomi and A. Lucchini, Crowns and factorization of the probabilistic zeta function of a finite group, J. Algebra , 265 (2003), no. 2, 651--668
2003
-
[16]
Detomi and A
E. Detomi and A. Lucchini, Probabilistic generation of finite groups with a unique minimal normal subgroup, J. Lond. Math. Soc. (2) 87 (2013), no. 3, 689--706
2013
-
[17]
Diestel, Graph theory
R. Diestel, Graph theory. Fifth edition. Graduate Texts in Mathematics, 173. Springer, Berlin, 2017
2017
-
[18]
Di Summa and A
M. Di Summa and A. Lucchini, The swap graph of the finite soluble groups. J. Algebraic Combin. 44 (2016), no. 2, 447--454
2016
-
[19]
Gasch\"utz , Zu einem von B.H
W. Gasch\"utz , Zu einem von B.H. und H. Neumann gestellten Problem, Mathematische Nachrichten 14 (1955), 249 -- 252
1955
-
[20]
u tz, Die E ulersche F unktion endlicher aufl\
W. Gasch \"u tz, Die E ulersche F unktion endlicher aufl\"osbarer G ruppen , Illinois J. Math. 3 (1959), 469--476
1959
-
[21]
Guralnick and W
R. Guralnick and W. Kantor, Probabilistic generation of finite simple groups. J. Algebra 234 (2000), 743--792
2000
-
[22]
Lucchini and C
A. Lucchini and C. Marion, Alternating and symmetric groups with Eulerian generating graph, Forum Math. Sigma 5 (2017)
2017
-
[23]
Gasch\"utz, Praefrattinigruppen, Arch
W. Gasch\"utz, Praefrattinigruppen, Arch. Mat
-
[24]
Miller, On the groups generated by two operators, Bull
G. Miller, On the groups generated by two operators, Bull. Amer. Math. Soc. 7 (1901), 424--426
1901
-
[25]
Steinberg, Generators for simple groups, Canad
R. Steinberg, Generators for simple groups, Canad. J. Math. 14 (1962) 277--283
1962
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.