Colorings with only rainbow arithmetic progressions
| Autor: | Pach, J��nos, Tomon, Istv��n |
|---|---|
| Rok vydání: | 2019 |
| Předmět: | |
| DOI: | 10.48550/arxiv.1912.07470 |
| Popis: | If we want to color $1,2,\ldots,n$ with the property that all 3-term arithmetic progressions are rainbow (that is, their elements receive 3 distinct colors), then, obviously, we need to use at least $n/2$ colors. Surprisingly, much fewer colors suffice if we are allowed to leave a negligible proportion of integers uncolored. Specifically, we prove that there exist $��,�� 8 pages, 1 figure |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|