Skip to content

Erdős problem 1098

Start work

Let GG be a group and Γ=Γ(G)\Gamma=\Gamma(G) be the non-commuting graph, with vertices the elements of GG and an edge between gg and hh if and only if gg and hh do not commute, gh≠hggh\neq hg.

Erdős Problems records this as proved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal4 retained
  4. Resolutionproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it7 share a topic
Group Theory8
None carries a Standing. Browse the topic.
Start workOpen sources