Finite versus infinite: An insufficient shift
Advances in Mathematics(2017)
摘要
The shift graph GS is defined on the space of infinite subsets of natural numbers by letting two sets be adjacent if one can be obtained from the other by removing its least element. We show that this graph is not a minimum among the graphs of the form Gf defined on some Polish space X, where two distinct points are adjacent if one can be obtained from the other by a given Borel function f:X→X. This answers the primary outstanding question from [8].
更多查看译文
关键词
Borel chromatic number,Graph generated by a function,Better-quasi-order,Graph homomorphism,Shift map,Ray
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要