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, .
Workspace
public preview
- #1098
- None
- 0
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
Formalization
- Machine