Unfriendly partition theorem for a countable locally finite graph
= Unfriendly partition theorem for a countable locally finite graph
Take unfriendly partitions of an exhaustion by finite induced subgraphs and use a diagonal subsequence to stabilize the colour of each vertex. Local finiteness makes every neighbourhood stabilize after finitely many steps, so each unfriendly inequality passes to the limit.