Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T21:10:32.563Z Has data issue: false hasContentIssue false

On Free Semigroups and Ramsey Numbers

Published online by Cambridge University Press:  20 November 2018

Gerard Lallement*
Affiliation:
Pennsylvania State University, Pennsylvania 16802
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

If the length of a word w in a free semigroup F(X) satisfies , then for every partition of F(X) into k classes, w has n consecutive factors of length ≥p in the same class. As a consequence, the diagonal Ramsey numbers R(pn+1, p+1, k) have 1+pnk as lower bound.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1974