arXiv 1610.033642016-10math.LOmath.CO

The Rado Path Decomposition Theorem

Peter Cholak, Gregory Igusa, Ludovic Patey, Mariya Soskova, Dan Turetsky

备注：: Updated Oct 4 2017. Our thanks to the readers for their comments. Updated in Dec 2018. The major change was the additional of the Section 1.1 which motivating the work within the current framework of computable combinatorics

英文摘要：

We discuss a theorem of Rado: Every r-coloring of the pairs of natural numbers has a path decomposition.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。