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, .
Result history
No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.
Correction history
No correction history
Technical details
Exact provenance
- Problem row
- sha256:af5728e8ea1d43b31ef321fc53cddcd4e633002fb88c12e0671d07538a5658b1
- Metadata
- sha256:2e964356f78c1a00274d48474dc2027486defb807cc16edf09496c7ea39c6fe4
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:5c1ed1b8d726345e7950fddd147793e28eb9aa733764c0de73bd769b9107ff66
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207