7 solved out of 27 shown (show only solved or open)
OPEN - $500 If$A\subseteq \{1,\ldots,N\}$with$\lvert A\rvert=n$is such that the subset sums$\sum_{a\in S}a$are distinct for all$S\subseteq A$then $N \gg 2^{n}.$ Erdős called this 'perhaps my first serious problem'. The powers of$2$show that$2^n$would be best possible here. The trivial lower bound is$N \gg 2^{n}/n$, since all$2^n$distinct subset sums must lie in$[0,Nn)$. Erdős and Moser [Er56] proved $N\geq (\tfrac{1}{4}-o(1))\frac{2^n}{\sqrt{n}}.$ A number of improvements of the constant have been given (see [St23] for a history), with the current record$\sqrt{2/\pi}$first proved in unpublished work of Elkies and Gleason. Two proofs achieving this constant are provided by Dubroff, Fox, and Xu [DFX21], who in fact prove the exact bound$N\geq \binom{n}{\lfloor n/2\rfloor}$. In [Er73] and [ErGr80] the generalisation where$A\subseteq (0,N]$is a set of real numbers such that the subset sums all differ by at least$1$is proposed, with the same conjectured bound. (The second proof of [DFX21] applies also to this generalisation.) This problem appears in Erdős' book with Spencer [ErSp74] in the final chapter titled 'The kitchen sink'. As Ruzsa writes in [Ru99] "it is a rich kitchen where such things go to the sink". See also [350]. Additional thanks to: Zachary Hunter SOLVED -$500
If $G$ is an edge-disjoint union of $n$ copies of $K_n$ then is $\chi(G)=n$?
Conjectured by Faber, Lovász, and Erdős (apparently 'at a party in Boulder, Colarado in September 1972' [Er81]).

Kahn [Ka92] proved that $\chi(G)\leq (1+o(1))n$ (for which Erdős gave him a 'consolation prize' of \$100). Hindman has proved the conjecture for$n<10$. Kang, Kelly, Kühn, Methuku, and Osthus [KKKMO21] have proved the answer is yes for all sufficiently large$n$. In [Er97d] Erdős asks how large$\chi(G)$can be if instead of asking for the copies of$K_n$to be edge disjoint we only ask for their intersections to be triangle free, or to contain at most one edge. SOLVED -$500
Let $f(n)$ be minimal such that there is an intersecting family $\mathcal{F}$ of sets of size $n$ (so $A\cap B\neq\emptyset$ for all $A,B\in \mathcal{F}$) with $\lvert \mathcal{F}\rvert=f(n)$ such that any set $S$ with $\lvert S\rvert \leq n-1$ is disjoint from at least one $A\in \mathcal{F}$.

Is it true that $f(n) \ll n?$

Conjectured by Erdős and Lovász [ErLo75], who proved that $\frac{8}{3}n-3\leq f(n) \ll n^{3/2}\log n$ for all $n$. The upper bound was improved by Kahn [Ka92b] to $f(n) \ll n\log n.$ (The upper bound constructions in both cases are formed by taking a random set of lines from a projective plane of order $n-1$, assuming $n-1$ is a prime power.)

This problem was solved by Kahn [Ka94] who proved the upper bound $f(n) \ll n$. The Erdős-Lovász lower bound of $\frac{8}{3}n-O(1)$ has not been improved, and it has been speculated (see e.g. [Ka94]) that the correct answer is $3n+O(1)$.

In [Er97f] Erdős asks about $f_\epsilon(n)$, defined analogously except with $\lvert S\rvert \leq n-1$ replaced by $\lvert S\rvert \leq (1-\epsilon)n$. He asks whether $f_\epsilon(n)/n\to \infty$ as $\epsilon \to 0$.

OPEN - $500 If$A\subseteq \mathbb{N}$is such that$A+A$contains all but finitely many integers then$\limsup 1_A\ast 1_A(n)=\infty$. Conjectured by Erdős and Turán. They also suggest the stronger conjecture that$\limsup 1_A\ast 1_A(n)/\log n>0$. Another stronger conjecture would be that the hypothesis$\lvert A\cap [1,N]\rvert \gg N^{1/2}$for all large$N$suffices. Erdős and Sárközy conjectured the stronger version that if$A=\{a_1<a_2<\cdots\}$and$B=\{b_1<b_2<\cdots\}$with$a_n/b_n\to 1$are such that$A+B=\mathbb{N}$then$\limsup 1_A\ast 1_B(n)=\infty$. See also [40]. OPEN -$500
Is there an infinite Sidon set $A\subset \mathbb{N}$ such that $\lvert A\cap \{1\ldots,N\}\rvert \gg_\epsilon N^{1/2-\epsilon}$ for all $\epsilon>0$?
The trivial greedy construction achieves $\gg N^{1/3}$. The current best bound of $\gg N^{\sqrt{2}-1+o(1)}$ is due to Ruzsa [Ru98]. (Erdős [Er73] had offered \$25 for any construction which achieves$N^{c}$for some$c>1/3$.) Erdős proved that for every infinite Sidon set$A$we have $\liminf \frac{\lvert A\cap \{1,\ldots,N\}\rvert}{N^{1/2}}=0,$ and also that there is a set$A\subset \mathbb{N}$with$\lvert A\cap \{1\ldots,N\}\rvert \gg_\epsilon N^{1/2-\epsilon}$such that$1_A\ast 1_A(n)=O(1)$. Erdős and Rényi have constructed, for any$\epsilon>0$, a set$A$such that $\lvert A\cap \{1\ldots,N\}\rvert \gg_\epsilon N^{1/2-\epsilon}$ for all large$N$and$1_A\ast 1_A(n)\ll_\epsilon 1$for all$n$. OPEN -$500
For what functions $g(N)\to \infty$ is it true that $\lvert A\cap \{1,\ldots,N\}\rvert \gg N^{1/2}g(N)$ implies $\limsup 1_A\ast 1_A(n)=\infty$?
It is possible that this is true even with $g(N)=O(1)$, from which the Erdős-Turán conjecture [28] would follow.
OPEN - $500 Let$A\subset\mathbb{N}$be an infinite set such that the triple sums$a+b+c$are all distinct for$a,b,c\in A$(aside from the trivial coincidences). Is it true that $\liminf \frac{\lvert A\cap \{1,\ldots,N\}\rvert}{N^{1/3}}=0?$ Erdős proved that if the pairwise sums$a+b$are all distinct aside from the trivial coincidences then $\liminf \frac{\lvert A\cap \{1,\ldots,N\}\rvert}{N^{1/2}}=0.$ Additional thanks to: Zachary Chase OPEN -$500
Is there $A\subseteq \mathbb{N}$ such that $\lim_{n\to \infty}\frac{1_A\ast 1_A(n)}{\log n}$ exists and is $\neq 0$?
A suitably constructed random set has this property if we are allowed to ignore an exceptional set of density zero. The challenge is obtaining this with no exceptional set. Erdős believed the answer should be no. Erdős and Sárkzözy proved that $\frac{\lvert 1_A\ast 1_A(n)-\log n\rvert}{\sqrt{\log n}}\to 0$ is impossible. Erdős suggests it may even be true that the $\liminf$ and $\limsup$ of $1_A\ast 1_A(n)/\log n$ are always separated by some absolute constant.
SOLVED - $500 If$f:\mathbb{N}\to \{-1,+1\}$then is it true that for every$C>0$there exist$d,m\geq 1$such that $\left\lvert \sum_{1\leq k\leq m}f(kd)\right\rvert > C?$ The Erdős discrepancy problem. This is true, and was proved by Tao [Ta16], who also proved the more general case when$f$takes values on the unit sphere. In [Er81] it is further conjectured that $\max_{md\leq x}\left\lvert \sum_{1\leq k\leq m}f(kd)\right\rvert \gg \log x.$ OPEN -$500
Let $f(n)\to \infty$ (possibly very slowly). Is there a graph of infinite chromatic number such that every finite subgraph on $n$ vertices can be made bipartite by deleting at most $f(n)$ edges?
Conjectured by Erdős, Hajnal, and Szemerédi [EHS82].

Rödl [Ro82] has proved this for hypergraphs, and also proved there is such a graph (with chromatic number $\aleph_0$) if $f(n)=\epsilon n$ for any fixed constant $\epsilon>0$.

It is open even for $f(n)=\sqrt{n}$. Erdős offered \$500 for a proof but only \$250 for a counterexample. This fails (even with $f(n)\gg n$) if the graph has chromatic number $\aleph_1$ (see [111]).

SOLVED - $500 Suppose that we have a family$\mathcal{F}$of subsets of$[4n]$such that$\lvert A\rvert=2n$for all$A\in\mathcal{F}$and for every$A,B\in \mathcal{F}$we have$\lvert A\cap B\rvert \geq 2$. Then $\lvert \mathcal{F}\rvert \leq \frac{1}{2}\left(\binom{4n}{2n}-\binom{2n}{n}^2\right).$ Conjectured by Erdős, Ko, and Rado [ErKoRa61]. This inequality would be best possible, as shown by taking$\mathcal{F}$to be the collection of all subsets of$[4n]$of size$2n$containing at least$n+1$elements from$[2n]$. Proved by Ahlswede and Khachatrian [AhKh97], who more generally showed the following. Let$2\leq t\leq k\leq m$and let$r\geq 0$be such that $\frac{1}{r+1}\leq \frac{m-2k+2t-2}{(t-1)(k-t+1)}< \frac{1}{r}.$ The largest possible family of subsets of$[m]$of size$k$, such that the pairwise intersections have size at least$t$, is the family of all subsets of$[m]$of size$k$which contain at least$t+r$elements from$\{1,\ldots,t+2r\}$. Additional thanks to: Tuan Tran OPEN -$500
Does every set of $n$ distinct points in $\mathbb{R}^2$ determine $\gg n/\sqrt{\log n}$ many distinct distances?
A $\sqrt{n}\times\sqrt{n}$ integer grid shows that this would be the best possible. Nearly solved by Guth and Katz [GuKa15] who proved that there are always $\gg n/\log n$ many distinct distances.

A stronger form (see [604]) may be true: is there a single point which determines $\gg n/\sqrt{\log n}$ distinct distances, or even $\gg n$ many such points, or even that this is true averaged over all points.

OPEN - $500 Does every set of$n$distinct points in$\mathbb{R}^2$contain at most$n^{1+O(1/\log\log n)}$many pairs which are distance 1 apart? The unit distance problem. In [Er94b] Erdős dates this conjecture to 1946. This would be the best possible, as is shown by a set of lattice points. It is easy to show that there are$O(n^{3/2})$many such pairs. The best known upper bound is$O(n^{4/3})$, due to Spencer, Szemerédi, and Trotter [SST84]. In [Er83c] and [Er85] Erdős offers \$250 for an upper bound of the form $n^{1+o(1)}$.

Part of the difficulty of this problem is explained by a result of Valtr (see [Sz16]), who constructed a metric on $\mathbb{R}^2$ and a set of $n$ points with $\gg n^{4/3}$ unit distance pairs (with respect to this metric). The methods of the upper bound proof of Spencer, Szemerédi, and Trotter [SST84] generalise to include this metric. Therefore to prove an upper bound better than $n^{4/3}$ some special feature of the Euclidean metric must be exploited.

See a survey by Szemerédi [Sz16] for further background and related results.

OPEN - $500 Let$f(n)$be maximal such that there exists a set$A$of$n$points in$\mathbb{R}^2$in which every$x\in A$has at least$f(n)$points in$A$equidistant from$x$. Is it true that$f(n)\leq n^{o(1)}$? Or even$f(n) < n^{c/\log\log n}$for some constant$c>0$? This is a stronger form of the unit distance conjecture (see [90]). The set of lattice points imply$f(n) > n^{c/\log\log n}$for some constant$c>0$. Erdős offered \$500 for a proof that $f(n) \leq n^{o(1)}$ but only \$100 for a counterexample. It is trivial that$f(n) \ll n^{1/2}$. A result of Pach and Sharir implies$f(n) \ll n^{2/5}$. Fishburn (personal communication to Erdős) proved that$6$is the smallest$n$such that$f(n)=3$and$8$is the smallest$n$such that$f(n)=4$, and suggested that the lattice points may not be best example. See also [754]. SOLVED -$500
Let $x_1,\ldots,x_n\in\mathbb{R}^2$ determine the set of distances $\{u_1,\ldots,u_t\}$. Suppose $u_i$ appears as the distance between $f(u_i)$ many pairs of points. Then for all $\epsilon>0$ $\sum_i f(u_i)^2 \ll_\epsilon n^{3+\epsilon}.$
The case when the points determine a convex polygon was been solved by Fishburn [Al63]. Note it is trivial that $\sum f(u_i)=\binom{n}{2}$. Solved by Guth and Katz [GuKa15] who proved the upper bound $\sum_i f(u_i)^2 \ll n^3\log n.$

OPEN - $500 Let$f(n)$be minimal such that any$f(n)$points in$\mathbb{R}^2$, no three on a line, contain$n$points which form the vertices of a convex$n$-gon. Prove that$f(n)=2^{n-2}+1$. The Erdős-Klein-Szekeres 'Happy Ending' problem. The problem originated in 1931 when Klein observed that$f(4)=5$. Turán and Makai showed$f(5)=9$. Erdős and Szekeres proved the bounds $2^{n-2}+1\leq f(n)\leq \binom{2n-4}{n-2}+1.$ ([ErSz60] and [ErSz35] respectively). There were several improvements of the upper bound, but all of the form$4^{(1+o(1))n}$, until Suk [Su17] proved $f(n) \leq 2^{(1+o(1))n}.$ The current best bound is due to Holmsen, Mojarrad, Pach, and Tardos [HMPT20], who prove $f(n) \leq 2^{n+O(\sqrt{n\log n})}.$ In [Er97e] Erdős clarifies that the \$500 is for a proof, and only offers \$100 for a disproof. This problem is #1 in Ramsey Theory in the graphs problem collection. See also [216] and [651]. Additional thanks to: Casey Tompkins SOLVED -$500
Let $r_3(N)$ be the size of the largest subset of $\{1,\ldots,N\}$ which does not contain a non-trivial $3$-term arithmetic progression. Prove that $r_3(N)\ll N/(\log N)^C$ for every $C>0$.
Proved by Kelley and Meka [KeMe23]. In [ErGr80] and [Er81] it is conjectured that this holds for every $k$-term arithmetic progression.

OPEN - $500 Let$A\subset (1,\infty)$be a countably infinite set such that for all$x\neq y\in A$and integers$k\geq 1$we have $\lvert kx -y\rvert \geq 1.$ Does this imply that $\liminf \frac{\lvert A\cap [1,x]\rvert}{x}=0?$ Or $\sum_{x\in A}\frac{1}{x\log x}<\infty,$ or $\sum_{\substack{x <n\\ x\in A}}\frac{1}{x}=o(\log n)?$ Perhaps even $\sum_{\substack{x <n\\ x\in A}}\frac{1}{x}\ll \frac{\log x}{\sqrt{\log\log x}}?$ Note that if$A$is a set of integers then the condition implies that$A$is a primitive set (that is, no element of$A$is divisible by any other), for which the convergence of$\sum_{n\in A}\frac{1}{n\log n}$was proved by Erdős [Er35], and that$\sum_{n<x}\frac{1}{n}=o(\log x)$was proved by Behrend [Be35]. In [Er73] mentions an unpublished proof of Haight that $\lim \frac{\lvert A\cap [1,x]\rvert}{x}=0$ holds if the elements of$A$are independent over$\mathbb{Q}$. Additional thanks to: Zachary Chase OPEN -$500
If $H$ is bipartite and is $r$-degenerate, that is, every induced subgraph of $H$ has minimum degree $\leq r$, then $\mathrm{ex}(n;H) \ll n^{2-1/r}.$
Conjectured by Erdős and Simonovits. Open even for $r=3$. Alon, Krivelevich, and Sudakov [AKS03] have proved $\mathrm{ex}(n;H) \ll n^{2-1/4r}.$ They also prove the full Erdős-Simonovits conjectured bound if $H$ is bipartite and the maximum degree in one component is $r$.

SOLVED - $500 If$H$is bipartite and is not$r$-degenerate, that is, there exists an induced subgraph of$H$with minimum degree$>r$then $\mathrm{ex}(n;H) > n^{2-\frac{1}{r}+\epsilon}.$ Conjectured by Erdős and Simonovits. Disproved by Janzer [Ja21], who constructed, for any$\epsilon>0$, a$3$-regular bipartite graph$H$such that $\mathrm{ex}(n;H)\ll n^{\frac{4}{3}+\epsilon}.$ See also [113], [146], and [714]. Additional thanks to: Zachary Hunter OPEN -$500
Let $\alpha\in[0,1/2)$ and $n,t\geq 1$. Let $F^{(t)}(n,\alpha)$ be the largest $m$ such that we can $2$-colour the edges of the complete $t$-uniform hypergraph on $n$ vertices such that if $X\subseteq [n]$ with $\lvert X\rvert \geq m$ then there are at least $\alpha \binom{\lvert X\rvert}{t}$ many $t$-subsets of $X$ of each colour.

For fixed $n,t$ as we change $\alpha$ from $0$ to $1/2$ does $F^{(t)}(n,\alpha)$ increase continuously or are there jumps? Only one jump?

For $\alpha=0$ this is the usual Ramsey function. A conjecture of Erdős, Hajnal, and Rado (see [562]) implies that $F^{(t)}(n,0)\asymp \log_{t-1} n$ and results of Erdős and Spencer imply that $F^{(t)}(n,\alpha) \asymp_\alpha (\log n)^{\frac{1}{t-1}}$ for $\alpha$ close to $1/2$.

Erdős believed there might be just one jump, occcurring at $\alpha=0$.

OPEN - $500 What is$\mathrm{ex}_3(n,K_4^3)$? That is, the largest number of$3$-edges which can placed on$n$vertices so that there exists no$K_4^3$, a set of 4 vertices which is covered by all 4 possible$3$-edges. A problem of Turán. Turán observed that dividing the vertices into three equal parts$X_1,X_2,X_3$, and taking the edges to be those triples that either have exactly one vertex in each part or two vertices in$X_i$and one vertex in$X_{i+1}$(where$X_4=X_1$) shows that $\mathrm{ex}_3(n,K_4^3)\geq\left(\frac{5}{9}+o(1)\right)\binom{n}{3}.$ This is probably the truth. The current best upper bound is $\mathrm{ex}_3(n,K_4^3)\leq 0.5611666\binom{n}{3},$ due to Razborov [Ra10]. See also [712] for the general case. OPEN -$500
Let $R_3(n)$ be the minimal $m$ such that if the edges of the $3$-uniform hypergraph on $m$ vertices are $2$-coloured then there is a monochromatic copy of the complete $3$-uniform hypergraph on $n$ vertices.

Is there some constant $c>0$ such that $R_3(n) \geq 2^{2^{cn}}?$

A special case of [562]. A problem of Erdős, Hajnal, and Rado [EHR65], who prove the bounds $2^{cn^2}< R_3(n)< 2^{2^{n}}$ for some constant $c>0$.

Erdős, Hajnal, Máté, and Rado [EHMR84] have proved a doubly exponential lower bound for the corresponding problem with $4$ colours.

OPEN - $500 Given$n$distinct points$A\subset\mathbb{R}^2$must there be a point$x\in A$such that $\#\{ d(x,y) : y \in A\} \gg n^{1-o(1)}?$ Or even$\gg n/\sqrt{\log n}$? The pinned distance problem, a stronger form of [89]. The example of an integer grid show that$n/\sqrt{\log n}$would be best possible. It may be true that there are$\gg n$many such points, or that this is true on average. In [Er97e] Erdős offers \$500 for a solution to this problem, but it is unclear whether he intended this for proving the existence of a single such point or for $\gg n$ many such points.

In [Er97e] Erdős wrote that he initially 'overconjectured' and thought that the answer to this problem is the same as for the number of distinct distances between all pairs (see [89]), but this was disproved by Harborth. It could be true that the answers are the same up to an additive factor of $n^{o(1)}$.

The best known bound is $\gg n^{c-o(1)},$ due to Katz and Tardos [KaTa04], where $c=\frac{48-14e}{55-16e}=0.864137\cdots.$

OPEN - $500 Let$A\subset \mathbb{N}$be a finite Sidon set. Is there some set$B$with$A\subseteq B$which is perfect difference set modulo$p^2+p+1$for some prime$p$? OPEN -$500
Determine, for any $k>r>2$, the value of $\frac{\mathrm{ex}_r(n,K_k^r)}{\binom{n}{r}},$ where $\mathrm{ex}_r(n,K_k^r)$ is the largest number of $r$-edges which can placed on $n$ vertices so that there exists no $K_k^r$, a set of $k$ vertices which is covered by all $\binom{k}{r}$ possible $r$-edges.
Turán proved that, when $r=2$, this limit is $\frac{1}{2}\left(1-\frac{1}{k-1}\right).$ Erdős [Er81] offered \$500 for the determination of this value for any fixed$k>r>2$, and \$1000 for 'clearing up the whole set of problems'.

See also [500] for the case $r=3$ and $k=4$.

OPEN - $500 Is it true that, for every bipartite graph$G$, there exists some$\alpha\in [0,1)$such that $\lim_{n\to \infty}\frac{\mathrm{ex}(n;G)}{n^{1+\alpha}}$ exists and is in$(0,\infty)$? A problem of Erdős and Simonovits. This is not true for hypergraphs, as shown by Ruzsa and Szemerédi [RuSz78], who proved that if$G$is a$3$-uniform hypergraph on$6$vertices containing$33$-edges then$\mathrm{ex}_3(n;G)=o(n^2)$and yet for every$\epsilon >0$$\mathrm{ex}_3(n;G) >n^{2-\epsilon}$ for all large enough$n\$.