combinatorics / Critical Graph Theory
Do arbitrarily large 4-chromatic edge-critical graphs exist with minimum degree bounded below by a positive constant times the number of vertices?
Temporal state
No reconciled state yet.
Append-only history
a new density-degree inequality gives δ(G) ≤ (3/10 + o(1))|V(G)|, improving 0.328; existence of a linear construction remains open
Research memory
Do arbitrarily large 4-chromatic edge-critical graphs exist with minimum degree bounded below by a positive constant times the number of vertices?
a new density-degree inequality gives δ(G) ≤ (3/10 + o(1))|V(G)|, improving 0.328; existence of a linear construction remains open
Evidence graph
No public relationships recorded yet.