Hostname: page-component-74656f9884-6grmk Total loading time: 0 Render date: 2026-11-06T01:39:28.497Z Has data issue: false hasContentIssue false

Some Ramsey Schur Numbers

Published online by Cambridge University Press:  15 February 2005

JENS-P. BODE
Affiliation:
Diskrete Mathematik, Technische Universität Braunschweig, 38023 Braunschweig, Germany (e-mail: jp.bode@tu-bs.de, h.harborth@tu-bs.de)
HANS-DIETRICH O. F. GRONAU
Affiliation:
Fachbereich Mathematik, Universität Rostock, Universitätsplatz 1, 18055 Rostock, Germany (e-mail: gronau@mathematik.uni-rostock.de)
HEIKO HARBORTH
Affiliation:
Diskrete Mathematik, Technische Universität Braunschweig, 38023 Braunschweig, Germany (e-mail: jp.bode@tu-bs.de, h.harborth@tu-bs.de)
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.

The Ramsey Schur number $RS(s,t)$ is the smallest $n$ such that every 2-colouring of the edges of $K_n$ with vertices $1,2,\ldots,n$ contains a green $K_s$ or there are vertices $x_1,x_2,\ldots,x_t$ fulfilling the equation $x_1+x_2+\cdots+x_{t-1}=x_t$ and all edges $(x_i,x_j)$ are red. We prove $RS(3,3)=11, RS(3,t)=t^2-3$ for $t\equiv1\ (\mbox{mod}\ 6)$ and $t=8$, and $RS(3,t)\geq t^2-3$.

Information

Type
Paper
Copyright
© 2005 Cambridge University Press