1 citations · 1 across the 12 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.LO2014
Self-embeddings of computable trees
Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman +2
We divide the class of infinite computable trees into three types. For the first and second types, computes a nontrivial self-embedding while for the third type computes…
math.LO2014★ 1 cited
Chromatic Numbers of Algebraic Hypergraphs
James H. Schmerl
A k-uniform hypergraph is algebraic if its vertex set is n-dimensional Euclidean space, for some n, and its hyperedge set is defined from the zero set of some polynomial. The chrom…
math.CO2014
Semialgebraic Graphs having Countable List-Chromatic Numbers
James H. Schmerl
The set of semialgebraic graphs having countable list-chromatic numbers is characterized. Some other related sets of graphs having countable list-chromatic numbers also are.