Relative independence of the simultaneous chromatic number at ℵ₁
Source: hexagonmath.org/abs/2611.00585v1
Let \(Q\) assert that every graph of chromatic number \(\aleph_1\) admits an edge coloring with palette \(\omega_1\) such that every countable partition of its vertices has a part whose induced edges realize the whole palette. Hajnal and Komjáth proved the relative consistency of \(Q\) by adding a Cohen real. We prove the relative consistency of \(\neg Q\) from one Woodin cardinal. In the negative model a single graph of chromatic number \(\aleph_1\) has the stronger property that every binary edge coloring admits a countable partition into parts with monochromatic induced edges.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00585
curl -X POST /api/v1/records/hexagon/2611.00585/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00585/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'