The Rado path decomposition theorem (Q2279931): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Decompositions of edge-colored infinite complete graphs into monochromatic paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of the notions of forcing and generic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cohesive set which is not high / rank
 
Normal rank
Property / cites work
 
Property / cites work: NON-PRINCIPAL ULTRAFILTERS, PROGRAM EXTRACTION AND HIGHER-ORDER REVERSE MATHEMATICS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning edge-coloured complete graphs into monochromatic cycles and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic Paths in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultrafilters in reverse mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2891272 / rank
 
Normal rank

Latest revision as of 06:20, 21 July 2024

scientific article
Language Label Description Also known as
English
The Rado path decomposition theorem
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references