Geodesic
Countable splitting graphs
Nick Haverkamp1
1 Institut für Philosophie Humboldt Universität Unter den Linden 6 10099 Berlin, Germany
Fundamenta Mathematicae, Tome 212 (2011) no. 3, pp. 217-233

Voir la notice de l'article provenant de la source Institute of Mathematics Polish Academy of Sciences

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.
DOI : 10.4064/fm212-3-2
Keywords: graph called splitting there labelling its vertices every infinite set natural numbers there sequence labels along way infinite path graph whose restriction eventually constant characterize countable splitting graphs those containing subgraph three simple types

Nick Haverkamp 1

1 Institut für Philosophie Humboldt Universität Unter den Linden 6 10099 Berlin, Germany 
@article{10_4064_fm212_3_2,
     author = {Nick Haverkamp},
     title = {Countable splitting graphs},
     journal = {Fundamenta Mathematicae},
     pages = {217--233},
     publisher = {mathdoc},
     volume = {212},
     number = {3},
     year = {2011},
     doi = {10.4064/fm212-3-2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.4064/fm212-3-2/}
}
TY  - JOUR
AU  - Nick Haverkamp
TI  - Countable splitting graphs
JO  - Fundamenta Mathematicae
PY  - 2011
SP  - 217
EP  - 233
VL  - 212
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.4064/fm212-3-2/
DO  - 10.4064/fm212-3-2
LA  - en
ID  - 10_4064_fm212_3_2
ER  - 
%0 Journal Article
%A Nick Haverkamp
%T Countable splitting graphs
%J Fundamenta Mathematicae
%D 2011
%P 217-233
%V 212
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.4064/fm212-3-2/
%R 10.4064/fm212-3-2
%G en
%F 10_4064_fm212_3_2
Nick Haverkamp. Countable splitting graphs. Fundamenta Mathematicae, Tome 212 (2011) no. 3, pp. 217-233. doi: 10.4064/fm212-3-2

Cité par Sources :