Conlon, David (2018) Monochromatic combinatorial lines of length three. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190819-170936221
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png) |
PDF
- Submitted Version
See Usage Policy. 79kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20190819-170936221
Abstract
We show that there is a constant c such that any colouring of the cube [3]^n in c log log n colours contains a monochromatic combinatorial line.
| Item Type: | Report or Paper (Discussion Paper) | ||||||
|---|---|---|---|---|---|---|---|
| Related URLs: |
| ||||||
| ORCID: |
| ||||||
| Additional Information: | Research supported by ERC Starting Grant 676632. | ||||||
| Funders: |
| ||||||
| Record Number: | CaltechAUTHORS:20190819-170936221 | ||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20190819-170936221 | ||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||
| ID Code: | 98033 | ||||||
| Collection: | CaltechAUTHORS | ||||||
| Deposited By: | Melissa Ray | ||||||
| Deposited On: | 20 Aug 2019 23:09 | ||||||
| Last Modified: | 03 Oct 2019 21:37 |
Repository Staff Only: item control page
