The Rado Path Decomposition Theorem
Logic
2018-12-19 v3 Combinatorics
Abstract
We discuss a theorem of Rado: Every r-coloring of the pairs of natural numbers has a path decomposition.
Keywords
Cite
@article{arxiv.1610.03364,
title = {The Rado Path Decomposition Theorem},
author = {Peter Cholak and Gregory Igusa and Ludovic Patey and Mariya Soskova and Dan Turetsky},
journal= {arXiv preprint arXiv:1610.03364},
year = {2018}
}
Comments
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