7 citations · 22 across the 33 of their papers we have counts for
Showing 1993 · math.LOShow all
2 papers · 2 filters
math.LO1993
Dominating functions and graphs
Reinhard Diestel, Saharon Shelah, Juris Steprāns
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…
math.LO1993
Borel partitions of infinite subtrees of a perfect tree
Alain Louveau, Boban Veličković, Saharon Shelah
A theorem of Galvin asserts that if the unordered pairs of reals are partitioned into finitely many Borel classes then there is a perfect set P such that all pairs from P lie in th…