Countable splitting graphs

  title={Countable splitting graphs},
  author={Nick Haverkamp},
  journal={Fundamenta Mathematicae},
  • N. Haverkamp
  • Published 2011
  • Mathematics
  • Fundamenta Mathematicae
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. 

Figures from this paper


A proof of the bounded graph conjecture
SummaryAn infinite graph is called bounded if for every labelling of its vertices with natural numbers there exists a sequence of natural numbers which eventually exceeds the labelling along any ray
Dominating Functions and Graphs
A graph is called dominating if its vertices can be labelled with integers in such a way that for every function f: omega-> omega the graph contains a ray whose sequence of labels eventually exceeds
A mengerian theorem for infinite graphs with ideal points
  • N. Polat
  • Mathematics
    J. Comb. Theory, Ser. B
  • 1991
Duality of Ends
There exists a natural homeomorphism between the end spaces of a graph and its dual, and that preserves the ‘end degree’, and it is proved that Tutte-connectivity is invariant under taking (infinite) duals.
Graph Theory
Gaph Teory Fourth Edition is standard textbook of modern graph theory which covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each chapter by one or two deeper results.
Combinatorial Cardinal Characteristics of the Continuum
The combinatorial study of subsets of the set N of natural numbers and of functions from N to N leads to numerous cardinal numbers, uncountable but no larger than the continuum. For example, how many