Erdős problem 1212
Let be the graph with vertex set those pairs with , in which we join two vertices if the differ in only one coordinate, and there by .
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:926b668ba5c83e37ff1f01d3d782690041fdef16403896079810caf41250075f
- Metadata
- sha256:bcd136bce1d3ce8e3f9fe6802e85e481aca2bb20270644854ef55fa23a9b73d0
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:08470b317b20548ec2eb81aab6a667dbf7869ad8433b2acf236c291ec47c12fa
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207