Skip to main content
2 of 2
deleted 10 characters in body

Graph on the set of all functions $f:\mathbb{N}\to\mathbb{N}$

Let $V$ be the set of all functions $f:\mathbb{N}\to\mathbb{N}$. Let two distinct functions $f,g:\mathbb{N}\to\mathbb{N}$ form an edge if and only if they differ in exactly one input $n\in\mathbb{N}$.

Let $G=(V,E)$. Clearly, $G$ has cliques of cardinality $\aleph_0$. Is $\chi(G) = \aleph_0$?