Erdős Problem #117
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: group theory.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
In a group \(G\), two elements commute if \(xy=yx\). Suppose no subset of more than \(n\) elements can be pairwise noncommuting. Equivalently, every collection of more than \(n\) elements contains two distinct elements that commute.
Let \(a(G)\) be the smallest number of abelian subgroups whose union is \(G\), and put
where \(\omega(G)\) is the largest number of pairwise noncommuting elements. Erdős #117 asks for the growth of \(h(n)\). The covering sets must be subgroups and must cover all elements, not merely a list of selected test elements.
A small example
If \(\omega(G)\le1\), every pair of distinct elements commutes, and \(G\) itself is abelian, so \(a(G)=1\). This gives \(h(1)=1\). For any group, each subset consisting of pairwise commuting elements generates an abelian subgroup; hence covering by abelian subgroups relates to colouring the graph whose adjacent vertices do not commute.
The whole group may be infinite even when its noncommutativity parameter is bounded. Finiteness of \(G\) is not a hypothesis in the original problem.
What is known
Pyber's 1987 paper, Journal of the London Mathematical Society 35, 287–295, gives exponential upper and lower scales: absolute constants \(c_2>c_1>1\) exist with \(c_1^n<h(n)<c_2^n\) in the historical parameter convention. Its publisher abstract explicitly establishes the related upper bound \(|G:Z(G)|\le c^n\).
A new, unadjudicated 20 August 2026 preprint by Guillaume Lecomte, Sharp Asymptotics for Abelian Covers of Groups with Bounded Noncommutativity, claims
It attributes a matching lower bound to extraspecial \(2\) groups and an upper bound to isoclinism reduction, alternating commutator forms, and Sylow/Fitting analysis. Its explicit section 2 relates noncommuting graphs to abelian covers and discusses reduction of groups of bounded noncommutativity to finite stem representatives.
This is a research claim, not an independently accepted solution. GCL inspected the source abstract, the reduction statement, and the proof architecture but did not verify every central-series estimate or the uniform error term. The maintained Erdős #117, last edited January 2026, remains OPEN and does not incorporate the August preprint. Its “open” status is historically accurate but must be read alongside this unresolved new claim.
GCL's current state
The pinned catalogue and original GCL issue #1386 retain OPEN. The 2026 candidate is recorded as a possible resolution requiring independent mathematical review, not as a certified result. No protected proof or accepted sharp exponential constant is asserted.
The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.
What remains
An immediate bounded successor is to verify the claimed graph-theoretic equivalence \(a(G)=\max(1,\chi(\Gamma_G))\) for finite groups such as \(S_3\) and \(D_8\), and to check the passage to quotients by the centre. Then independently referee the preprint's sharp bound for extraspecial \(2\) groups and the finite \(p\) group upper-bound lemma. Acceptance for a status upgrade requires source-fidelity, valid uniform hypotheses and independent proof-level review, not a preprint abstract alone.
Sources and claim boundaries
- Lecomte, arXiv:2608.20507, 20 August 2026 candidate sharp asymptotic.
- Pyber, JLMS 35 (1987), 287–295, primary historical result.
- Maintained Erdős #117; GCL issue #1386.
No independent certification of the 2026 theorem, prize claim or editorial admission is made.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1386 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.