Partition theorems for factorizations of ascending parameter words (Q1292842): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Theorems on Classifications of Subsets of a Given Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: REFLECTIVE PROPERTIES OF FREE SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Ramsey theorem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3298208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Baire Sets of k-Parameter Words are Ramsey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive Recursive Bounds for Van Der Waerden Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the disjoint unions theorem / rank
 
Normal rank

Latest revision as of 21:35, 28 May 2024

scientific article
Language Label Description Also known as
English
Partition theorems for factorizations of ascending parameter words
scientific article

    Statements

    Partition theorems for factorizations of ascending parameter words (English)
    0 references
    0 references
    0 references
    0 references
    29 November 1999
    0 references
    0 references
    dynamic Ramsey theory
    0 references
    fixed rank partitions
    0 references