Published November 2, 2015
| Version Submitted
Discussion Paper
Open
Hedgehogs are not colour blind
Creators
Abstract
We exhibit a family of 3-uniform hypergraphs with the property that their 2-colour Ramsey numbers grow polynomially in the number of vertices, while their 4-colour Ramsey numbers grow exponentially. This is the first example of a class of hypergraphs whose Ramsey numbers show a strong dependence on the number of colours.
Additional Information
Conlon research supported by a Royal Society University Research Fellowship. Fox research supported by a Packard Fellowship, by NSF Career Award DMS-1352121 and by an Alfred P. Sloan Fellowship. Rödl research partially supported by NSF grants DMS-1102086 and DMS-1301698.Attached Files
Submitted - 1511.00563.pdf
Files
1511.00563.pdf
Additional details
Identifiers
- Eprint ID
- 98023
- Resolver ID
- CaltechAUTHORS:20190819-170900578
Related works
- Describes
- http://arxiv.org/abs/1511.00563 (URL)
Funding
- Royal Society
- David and Lucile Packard Foundation
- NSF
- DMS-1352121
- Alfred P. Sloan Foundation
- NSF
- DMS-1102086
- NSF
- DMS-1301698
Dates
- Created
-
2019-08-20Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field
Caltech Custom Metadata
- Caltech groups
- Mathematics Department