Countable splitting graphs

Nick Haverkamp. "Countable splitting graphs." Fundamenta Mathematicae 212.3 (2011): 217-233. <http://eudml.org/doc/282902>.

@article{NickHaverkamp2011,
abstract = {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 constant. We characterize the countable splitting graphs as those containing a subgraph of one of three simple types.},
author = {Nick Haverkamp},
journal = {Fundamenta Mathematicae},
keywords = {splitting graph; splitting number; infinite graph; cardinal characteristic of the continuum},
language = {eng},
number = {3},
pages = {217-233},
title = {Countable splitting graphs},
url = {http://eudml.org/doc/282902},
volume = {212},
year = {2011},
}

TY - JOUR
AU - Nick Haverkamp
TI - Countable splitting graphs
JO - Fundamenta Mathematicae
PY - 2011
VL - 212
IS - 3
SP - 217
EP - 233
AB - 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 constant. We characterize the countable splitting graphs as those containing a subgraph of one of three simple types.
LA - eng
KW - splitting graph; splitting number; infinite graph; cardinal characteristic of the continuum
UR - http://eudml.org/doc/282902
ER -