Countable splitting graphs
Nick Haverkamp · Fundamenta Mathematicae · 2011
A graph is called splitting if there is a 0-1 labelling of its vertices such that for every infinite set $C$ of natural numbers there is a sequence of labels along a 1-way infinite path in the graph whose restriction to $C$ is not eventually const