Paper
Stationary list colorings
Authors
Yusuke Hayashi
Abstract
Komjath studied the list chromatic number of infinite graphs and introduced the notion of restricted list chromatic number. For a graph and a cardinal , we say that is restricted list colorable for if for every there is a choice function of such that whenever . 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 .