Sub-Ramsey numbers of arithmetic progressions (Q582303): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Extremal problems concerning transformations of the set of edges of the complete graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extremal problems concerning transformations of the edges of the complete hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3900124 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the structure of set-mappings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On sets of integers containing k elements in arithmetic progression / rank | |||
Normal rank | |||
Latest revision as of 12:14, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sub-Ramsey numbers of arithmetic progressions |
scientific article |
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
