google-deepmind / google-deepmind/formal-conjectures

Erdős Problem 190

Open
#414 0 comments 0 reactions 0 assignees View on GitHub
ams-05: Combinatorics erdos-problems new conjecture
Dominant language
Lean
Stars
1.3k
Forks
485
Avg merge
1d 20h
Merged PRs (30d)
328

Description

### What is the conjecture

https://www.erdosproblems.com/190

Let $H(k)$ be the smallest $N$ such that in any finite colouring of $\\{1,\ldots,N\\}$ (into any number of colours) there is always either a monochromatic $k$-term arithmetic progression or a rainbow arithmetic progression (i.e. all elements are different colours). Estimate $H(k)$. Is it true that
$$H(k)^{1/k}/k \to \infty$$
as $k\to\infty$?

Status: open

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else

Contributor guide

Open the contributing guide

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.