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?
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
No source in this release retained material for this Problem beyond its catalogue entry.
Reported activity
Reported by these sources. Not reviewed here.
AI building on literature
- Machine
argument
- Machine
- Reported outcome