2 papers
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.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.