Partition theorems for factorizations of ascending parameter words

DOI10.1016/S0012-365X(99)90083-3zbMath0927.68073OpenAlexW4231339168MaRDI QIDQ1292842

Willem L. Fouché, L. M. Pretorious, C. J. Swanepoel

Publication date: 29 November 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90083-3

zbMATH Keywords

dynamic Ramsey theoryfixed rank partitions

Mathematics Subject Classification ID

Combinatorics on words (68R15) Ramsey theory (05D10)

Cites Work

• A Ramsey theorem for trees
• Bounds for the disjoint unions theorem
• Baire Sets of k-Parameter Words are Ramsey
• Primitive Recursive Bounds for Van Der Waerden Numbers
• REFLECTIVE PROPERTIES OF FREE SEMIGROUPS
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item