Erdős problem 1032
Do arbitrarily large 4-chromatic edge-critical graphs exist with minimum degree bounded below by a positive constant times the number of vertices?
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:aa30b3776211ada7d8a79ebfe33a79d356d5ec925769c3435697bb3cd0e8fc82
- Metadata
- sha256:5ea9cb321251a28b8ca4f9488f638237350a0cfde9f1f8fe95bb4755b1a555cb
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:058ca0f2c3d37bdacb841240585947d9aef404696b83a907df03526c8f32c8a8
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207