Sub-Ramsey numbers of arithmetic progressions (Q582303)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4130415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sub-Ramsey numbers of arithmetic progressions |
scientific article; zbMATH DE number 4130415 |
Statements
Sub-Ramsey numbers of arithmetic progressions (English)
0 references
1989
0 references
A sub-k-coloring of 1,...,n is an assignment of colors to these numbers so that each color is used at most k-times. The number sr(m,k) is defined as the minimal such n that every sub-k-color of 1,...,n contains an arithmetic progression of m terms in which no two elements have the same color. Good upper and lower bounds for sr(m,k) are given.
0 references
upper bounds
0 references
sub-k-coloring
0 references
lower bounds
0 references
0.885819137096405
0 references
0.8602385520935059
0 references
0.8530343770980835
0 references
