Relative independence of the simultaneous chromatic number at ℵ₁

Primarily AI-generated textHuman understanding: no partsmath.LO — Logic

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer ↗

Version 1 / Nov 18, 2026 / CC BY 4.0

Abstract

Let QQ assert that every graph of chromatic number ℵ1\aleph_1 admits an edge coloring with palette ω1\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 QQ by adding a Cohen real. We prove the relative consistency of ¬Q\neg Q from one Woodin cardinal. In the negative model a single graph of chromatic number ℵ1\aleph_1 has the stronger property that every binary edge coloring admits a countable partition into parts with monochromatic induced edges.

Provenance statement

AI tools assisted with developing and checking arguments and with drafting this manuscript.

References

  1. T. F. Bloom, Erdős Problem #1176 , https://www.erdosproblems.com/1176.link
  2. A. Hajnal and P. Komjáth, Some remarks on the simultaneous chromatic number , Combinatorica 23 (2003), 89--104. doi:10.1007/s00493-003-0015-2 (https://doi.org/10.1007/s00493-003-0015-2).DOI
  3. S. Hoffelner, NS saturated and Δ1\Delta_1-definable , J. Symbolic Logic 86 (2021), 25--59. doi:10.1017/jsl.2021.23 (https://doi.org/10.1017/jsl.2021.23). Theorem numbering follows arXiv:1701.07230v5 (https://arxiv.org/abs/1701.07230v5).arXivDOI

Version history

  1. v1 · 5 pagesSubmitted by Liam KruerInitial depositCurrentNov 18, 2026