Erdős problem 1098
Let be a group and be the non-commuting graph, with vertices the elements of and an edge between and if and only if and do not commute, .
- Formal statements
- 1 api · 3 solved
- Erdős Problems says
- proved (Lean)
- Decision here
- No current contribution
- Checks
- 0 checks · 4 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained