The Rado Path Decomposition Theorem
arXiv:1610.03364
Abstract
We discuss a theorem of Rado: Every r-coloring of the pairs of natural numbers has a path decomposition.
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