Countable splitting graphs

• Autorzy: Nick Haverkamp
• Języki publikacji: EN

Abstrakty

EN

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.

Kategorie tematyczne

• 03E17: Cardinal characteristics of the continuum
• 05C75: Structural characterization of families of graphs
• 05C99: None of the above, but in this section

• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Fundamenta Mathematicae
• Rocznik: 2011
• Tom: 212
• Numer: 3
• Strony: 217-233

Daty

wydano

2011

Twórcy

autor

Nick Haverkamp

• Institut für Philosophie, Humboldt Universität, Unter den Linden 6, 10099 Berlin, Germany

Identyfikatory

DOI

10.4064/fm212-3-2