Erdős Problem #1098
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: proved (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.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Two elements of a group need not commute: multiplying them in one order may differ from multiplying them in the other. Draw a graph with one vertex for every element of a group \(G\), joining \(g\) and \(h\) exactly when
Erdős Problem #1098 asks: if this noncommuting graph has no infinite clique, must it have some finite upper bound on the sizes of all cliques?
The group itself can be infinite. The desired upper bound can depend on the group.
A small example
Consider \(S_3\), the group of all six permutations of three objects. Its center, the elements that commute with everything, consists only of the identity. Therefore the center has index six.
Direct enumeration of all six permutations and their products finds a largest set of pairwise noncommuting elements of size four: the three transpositions together with one three-cycle. No larger clique exists. The bound of six obtained from the center index is valid but not sharp.
What is known
The question was solved by B. H. Neumann (1976). The maintained catalogue states Neumann's stronger equivalence:
A group has no infinite set of pairwise noncommuting elements exactly when its center has finite index.
One direction has a short explanation. Suppose \([G:Z(G)]=m<\infty\). Two elements in the same coset \(gZ(G)\) commute, since each is \(gz\) for some central \(z\). Hence a pairwise noncommuting subset can take at most one element from each of the \(m\) cosets:
Thus finite center index implies a uniform bound on clique size. The reverse implication for an arbitrary group is the substantive part of Neumann's externally published result.
GCL's current state
Authenticated source audit #2369 independently replays the entire finite \(S_3\) multiplication table and clique search, and records the elementary center-coset implication.
The original 1976 proof of the nontrivial converse has not yet been audited. The current catalogue reports a formalized statement, but a matching file was not found in the older frozen formal-conjectures snapshot.
What remains
Check Neumann's original statement and proof, particularly the converse and its use of infinite-group arguments. Refresh the formal-statement source to the current version without claiming a proof from an absent older file.
Sources and claim boundaries
Erdős Problem #1098; B. H. Neumann (1976), externally credited theorem; authenticated source return #2369. The coset bound and \(S_3\) calculation are independently justified; the full equivalence is an external solved result. This manuscript is unaccepted.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2369 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- 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.