The Rado path decomposition theorem
From MaRDI portal
Publication:2279931
DOI10.1007/s11856-019-1916-0zbMath1429.05062arXiv1610.03364OpenAlexW2969580174MaRDI QIDQ2279931
Gregory Igusa, Ludovic Patey, Dan Turetsky, Mariya Ivanova Soskova, Peter A. Cholak
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
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II
- Decompositions of edge-colored infinite complete graphs into monochromatic paths
- Ultrafilters in reverse mathematics
- NON-PRINCIPAL ULTRAFILTERS, PROGRAM EXTRACTION AND HIGHER-ORDER REVERSE MATHEMATICS
- Monochromatic Paths in Graphs
- A cohesive set which is not high
- Set Theory
- Some applications of the notions of forcing and generic sets
This page was built for publication: The Rado path decomposition theorem