Universal countably chromatic graph
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917071616475136 |
|---|---|
| author | Kivimäki, Siiri |
| author_facet | Kivimäki, Siiri |
| contents | We show that the existence of a universal countably chromatic graph of size $\aleph_1$ together with the failure of continuum hypothesis is consistent. The proof is a forcing iteration of strongly proper ccc posets. The construction works for any uncountable successor cardinal $κ^+$, where $κ$ is regular. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_07608 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Universal countably chromatic graph Kivimäki, Siiri Logic 03E35 We show that the existence of a universal countably chromatic graph of size $\aleph_1$ together with the failure of continuum hypothesis is consistent. The proof is a forcing iteration of strongly proper ccc posets. The construction works for any uncountable successor cardinal $κ^+$, where $κ$ is regular. |
| title | Universal countably chromatic graph |
| topic | Logic 03E35 |
| url | https://arxiv.org/abs/2511.07608 |