Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2512.06876 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908714260234240 |
|---|---|
| author | Hayashi, Yusuke |
| author_facet | Hayashi, Yusuke |
| contents | Komjath studied the list chromatic number of infinite graphs and introduced the notion of restricted list chromatic number. For a graph $X=(V_X,E_X)$ and a cardinal $κ$, we say that $X$ is restricted list colorable for $κ$ if for every $L:V_X\to[κ]^κ$ there is a choice function $c$ of $L$ such that $c(v)\neq c(w)$ whenever ${v,w}\in E_X$. In this paper, we discuss a variation, stationary list colorability for $κ$, obtained by replacing $[κ]^κ$ with the set of all stationary subsets of $κ$. We compare the stationary list colorability with other coloring properties. Among other things, we prove that the stationary list colorability is essentially different from other coloring properties including the restricted list colorability. We also prove the consistency result showing that for some $κ<λ$, restricted and stationary list colorability at $κ$ do not imply the corresponding properties at $λ$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_06876 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Stationary list colorings Hayashi, Yusuke Logic Combinatorics Komjath studied the list chromatic number of infinite graphs and introduced the notion of restricted list chromatic number. For a graph $X=(V_X,E_X)$ and a cardinal $κ$, we say that $X$ is restricted list colorable for $κ$ if for every $L:V_X\to[κ]^κ$ there is a choice function $c$ of $L$ such that $c(v)\neq c(w)$ whenever ${v,w}\in E_X$. In this paper, we discuss a variation, stationary list colorability for $κ$, obtained by replacing $[κ]^κ$ with the set of all stationary subsets of $κ$. We compare the stationary list colorability with other coloring properties. Among other things, we prove that the stationary list colorability is essentially different from other coloring properties including the restricted list colorability. We also prove the consistency result showing that for some $κ<λ$, restricted and stationary list colorability at $κ$ do not imply the corresponding properties at $λ$. |
| title | Stationary list colorings |
| topic | Logic Combinatorics |
| url | https://arxiv.org/abs/2512.06876 |