The Rado path decomposition theorem

DOI10.1007/S11856-019-1916-0MaRDI QIDQ2279931zbMATH OpenOpenAlexFDO

Authors Gregory Igusa, Ludovic Patey, Dan Turetsky, Peter A. Cholak, Mariya I. Soskova

Publication date 17 December 2019

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.03364

zbMATH Keywords

path of color

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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

Recommendations

• Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II
• scientific article; zbMATH DE number 15152
• Monochromatic infinite paths
• Decompositions of edge-colored infinite complete graphs into monochromatic paths
• Erdős-Kakutani phenomena for paths

Cites work

• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 3262254 (Why is no real title available?)
• A cohesive set which is not high
• Computability theory
• Decompositions of edge-colored infinite complete graphs into monochromatic paths
• Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II
• From bounded arithmetic to second order arithmetic via automorphisms
• Monochromatic Paths in Graphs
• Non-principal ultrafilters, program extraction and higher-order reverse mathematics
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Set Theory
• Some applications of the notions of forcing and generic sets
• Ultrafilters in reverse mathematics

Cited in

(1)

• Riordan paths and derangements

This page was built for publication: The Rado path decomposition theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279931)