69 solved out of 206 shown (show only solved or open)
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
Let $\epsilon>0$ and $n$ be sufficiently large depending on $\epsilon$. Is there a graph on $n$ vertices with $\geq n^2/8$ many edges which contains no $K_4$ such that the largest independent set has size at most $\epsilon n$?
In other words, if $\mathrm{rt}(n;k,\ell)$ is the Ramsey-Turán number then is it true that (for sufficiently large $n$) $\mathrm{rt}(n; 4,\epsilon n)\geq n^2/8?$

Conjectured by Bollobás and Erdős [BoEr76], who proved the existence of such a graph with $(1/8+o(1))n^2$ many edges. Solved by Fox, Loh, and Zhao [FLZ15], who proved that for every $n\geq 1$ there exists a graph on $n$ vertices with $\geq n^2/8$ many edges, containing no $K_4$, whose largest independent set has size at most $\ll \frac{(\log\log n)^{3/2}}{(\log n)^{1/2}}n.$

OPEN
Can every triangle-free graph on $5n$ vertices be made bipartite by deleting at most $n^2$ edges?
The blow-up of $C_5$ shows that this would be the best possible. The best known bound is due to Balogh, Clemen, and Lidicky [BCL21], who proved that deleting at most $1.064n^2$ edges suffices.
SOLVED
Does every triangle-free graph on $5n$ vertices contain at most $n^5$ copies of $C_5$?
Győri proved this with $1.03n^5$, which has been improved by Füredi. The answer is yes, as proved independently by Grzesik [Gr12] and Hatami, Hladky, Král, Norine, and Razborov [HHKNR13].

In [Er97f] Erdős asks more generally: if $r\geq 5$ is odd and a graph has $rn$ vertices and the smallest odd cycle has size $r$ then is the number of cycles of size $r$ at most $n^{r}$?

Additional thanks to: Casey Tompkins, Tuan Tran
SOLVED
If $G$ is a graph with infinite chromatic number and $a_1<a_2<\cdots$ are lengths of the odd cycles of $G$ then $\sum \frac{1}{a_i}=\infty$.
Conjectured by Erdős and Hajnal, and solved by Liu and Montgomery [LiMo20]. In [Er81] Erdős asks whether the $a_i$ must in fact have positive upper density. The lower density of the set can be $0$ since there are graphs of arbitrarily large chromatic number and girth.

SOLVED
If $G$ is a graph which contains odd cycles of $\leq k$ different lengths then $\chi(G)\leq 2k+2$, with equality if and only if $G$ contains $K_{2k+2}$.
Conjectured by Bollobás and Erdős. Bollobás and Shelah have confirmed this for $k=1$. Proved by Gyárfás [Gy92], who proved the stronger result that, if $G$ is 2-connected, then $G$ is either $K_{2k+2}$ or contains a vertex of degree at most $2k$.

A stronger form was established by Gao, Huo, and Ma [GaHuMa21], who proved that if a graph $G$ has chromatic number $\chi(G)\geq 2k+3$ then $G$ contains cycles of $k+1$ consecutive odd lengths.

SOLVED
Is it true that the number of graphs on $n$ vertices which do not contain $G$ is $\leq 2^{(1+o(1))\mathrm{ex}(n;G)}?$
If $G$ is not bipartite the answer is yes, proved by Erdős, Frankl, and Rödl [ErFrRo86]. The answer is no for $G=C_6$, the cycle on 6 vertices. Morris and Saxton [MoSa16] have proved there are at least $2^{(1+c)\mathrm{ex}(n;C_6)}$ such graphs for infinitely many $n$, for some constant $c>0$. It is still possible (and conjectured by Morris and Saxton) that the weaker bound of $2^{O(\mathrm{ex}(n;G))}$ holds for all $G$.
OPEN
Does every graph on $n$ vertices with $>\mathrm{ex}(n;C_4)$ edges contain $\gg n^{1/2}$ many copies of $C_4$?
Conjectured by Erdős and Simonovits, who could not even prove that at least $2$ copies of $C_4$ are guaranteed.

He, Ma, and Yang [HeMaYa21] have proved this conjecture when $n=q^2+q+1$ for some even integer $q$.

OPEN
For any graph $H$ is there some $c=c(H)>0$ such that every graph $G$ on $n$ vertices that does not contain $H$ as an induced subgraph contains either a complete graph or independent set on $\geq n^c$ vertices?
Conjectured by Erdős and Hajnal [ErHa89], who proved that a complete graph or independent set must exist on $\geq \exp(c_H\sqrt{\log n})$ many vertices, where $c_H>0$ is some constant. This was improved by Bucić, Nguyen, Scott, and Seymour [BNSS23] to $\geq \exp(c_H\sqrt{\log n\log\log n}).$
OPEN
If $G_1,G_2$ are two graphs with chromatic number $\aleph_1$ then must there exist a graph $G$ whose chromatic number is $4$ (or even $\aleph_0$) which is a subgraph of both $G_1$ and $G_2$?
Erdős, Hajnal, and Shelah have shown that $G_1$ and $G_2$ must both contain all sufficiently large cycles.
SOLVED
Does every graph with infinite chromatic number contain a cycle of length $2^n$ for infinitely many $n$?
Conjectured by Mihók and Erdős. It is likely that $2^n$ can be replaced by any sufficiently quickly growing sequence (e.g. the squares).

David Penman has observed that this is certainly true if the graph has uncountable chromatic number, since by a result of Erdős and Hajnal [ErHa66] such a graph must contain arbitrarily large finite complete bipartite graphs (see also Theorem 3.17 of Reiher [Re24]).

Zach Hunter has observed that this follows from the work of Liu and Montgomery [LiMo20]: if $G$ has infinite chromatic number then, for infinitely many $r$, it must contain some finite connected subgraph $G_r$ with chromatic number $r$ (via the de Bruijn-Erdős theorem [dBEr51]). Each $G_r$ contains some subgraph $H_r$ with minimum degree at least $r-1$, and hence via Theorem 1.1 of [LiMo20] there exists some $\ell_r\geq r^{1-o(1)}$ such that $H_r$ contains a cycle of every even length in $[(\log \ell)^8,\ell]$.

Additional thanks to: Zach Hunter and David Penman
OPEN - $1000 Does every graph with minimum degree at least 3 contain a cycle of length$2^k$for some$k\geq 2$? Conjectured by Erdős and Gyárfás, who believed the answer must be negative, and in fact for every$r$there must be a graph of minimum degree at least$r$without a cycle of length$2^k$for any$k\geq 2$. This was solved in the affirmative if the minimum degree is larger than some absolute constant by Liu and Montgomery [LiMo20] (therefore disproving the above stronger conjecture of Erdős and Gyárfás). Liu and Montgomery prove a much stronger result: if the average degree of$G$is sufficiently large then there is some large integer$\ell$such that for every even integer$m\in [(\log \ell)^8,\ell]$,$G$contains a cycle of length$m$. Additional thanks to: Yuval Wigderson OPEN Let$G$be a graph with$n$vertices and$kn$edges, and$a_1<a_2<\cdots $be the lengths of cycles in$G$. Is it true that $\sum\frac{1}{a_i}\gg \log k?$ Is the sum$\sum\frac{1}{a_i}$minimised when$G$is a complete bipartite graph? A problem of Erdős and Hajnal. Gyárfás, Komlós, and Szemerédi [GyKoSz84] have proved that this sum is$\gg \log k$. Liu and Montgomery [LiMo20] have proved the asymptotically sharp lower bound of$\geq (\tfrac{1}{2}-o(1))\log k$. See also [57]. OPEN Let$\mathfrak{c}$be the ordinal of the real numbers,$\beta$be any countable ordinal, and$2\leq n<\omega$. Is it true that$\mathfrak{c}\to (\beta, n)_2^3$? Erdős and Rado proved that$\mathfrak{c}\to (\omega+n,4)_2^3$for any$2\leq n<\omega$. SOLVED Is it true that for every infinite arithmetic progression$P$which contains even numbers there is some constant$c=c(P)$such that every graph with average degree at least$c$contains a cycle whose length is in$P$? This has been proved by Bollobás [Bo77]. The best dependence of the constant$c(P)$is unknown. See also [72]. SOLVED -$100
Is there a set $A\subset \mathbb{N}$ of density $0$ and a constant $c>0$ such that every graph on sufficiently many vertices with average degree $\geq c$ contains a cycle whose length is in $A$?
Bollobás [Bo77] proved that such a $c$ does exist if $A$ is an infinite arithmetic progression containing even numbers (see [71]).

Erdős was 'almost certain' that if $A$ is the set of powers of $2$ then no such $c$ exists (although he conjectured that $n$ vertices and average degree $\gg (\log n)^{C}$ suffices for some $C=O(1)$). If $A$ is the set of squares (or the set of $p\pm 1$ for $p$ prime) then he had no guess.

Solved by Verstraëte [Ve05], who gave a non-constructive proof that such a set $A$ exists.

Liu and Montgomery [LiMo20] proved that in fact this is true when $A$ is the set of powers of $2$ (more generally any set of even numbers which doesn't grow too quickly) - in particular this contradicts the previous belief of Erdős.

SOLVED
Let $k\geq 0$. Let $G$ be a graph on $n$ vertices such that every subgraph $H\subseteq G$ contains an independent set of size $\geq \frac{1}{2}\lvert H\rvert-k$. Must $G$ be the union of a bipartite graph and $O_k(1)$ many vertices?
Proved by Reed [Re99]. (Thanks also to Reed for pointing out that the case $k=0$ is trivial, since if $G$ is not bipartite then $G$ contains an odd cycle.)
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]). OPEN Is there a graph of chromatic number$\aleph_1$such that for all$\epsilon>0$if$n$is sufficiently large and$H$is a subgraph on$n$vertices then$H$contains an independent set of size$>n^{1-\epsilon}$? Conjectured by Erdős, Hajnal, and Szemerédi [EHS82]. See also [750]. SOLVED Is it true that in any$2$-colouring of the edges of$K_n$there must exist at least $(1+o(1))\frac{n^2}{12}$ many edge-disjoint monochromatic triangles? Conjectured by Erdős, Faudreee, and Ordman. This would be best possible, as witnessed by dividing the vertices of$K_n$into two equal parts and colouring all edges between the parts red and all edges inside the parts blue. The answer is yes, proved by Gruslys and Letzter [GrLe20]. In [Er97d] Erdős also asks for a lower bound for the count of edge-disjoint monochromatic triangles in single colour (the colour chosen to maximise this quantity), and speculates that the answer is$\geq cn^2$for some constant$c?1/24$. Additional thanks to: Tuan Tran OPEN -$250
Find the value of $\lim_{k\to \infty}R(k)^{1/k}$.
Erdős offered \$100 for just a proof of the existence of this constant, without determining its value. He also offered \$1000 for a proof that the limit does not exist, but says 'this is really a joke as [it] certainly exists'. Erdős proved $\sqrt{2}\leq \liminf_{k\to \infty}R(k)^{1/k}\leq \limsup_{k\to \infty}R(k)^{1/k}\leq 4.$ The upper bound has been improved to $4-\tfrac{1}{128}$ by Campos, Griffiths, Morris, and Sahasrabudhe [CGMS23].

This problem is #3 in Ramsey Theory in the graphs problem collection.

OPEN - $100 Give a constructive proof that$R(k)>C^k$for some constant$C>1$. Erdős gave a simple probabilistic proof that$R(k) \gg k2^{k/2}$. Equivalently, this question asks for an explicit construction of a graph on$n$vertices which does not contain any clique or independent set of size$\geq c\log n$for some constant$c>0$. Cohen [Co15] (see the introduction for further history) constructed a graph on$n$vertices which does not contain any clique or independent set of size $\geq 2^{(\log\log n)^{C}}$ for some constant$C>0$. Li [Li23b] has recently improved this to $\geq (\log n)^{C}$ for some constant$C>0$. This problem is #4 in Ramsey Theory in the graphs problem collection. Additional thanks to: Jesse Goodman, Mehtaab Sawhney OPEN We say$G$is Ramsey size linear if$R(G,H)\ll m$for all graphs$H$with$m$edges and no isolated vertices. Are there infinitely many graphs$G$which are not Ramsey size linear but such that all of its subgraphs are? Asked by Erdős, Faudree, Rousseau, and Schelp [EFRS93].$K_4$is the only known example of such a graph. OPEN Let$c>0$and let$f_c(n)$be the maximal$m$such that every graph$G$with$n$vertices and at least$cn^2$edges, where each edge is contained in at least one triangle, must contain a book of size$m$, that is, an edge shared by at least$m$different triangles. Estimate$f_c(n)$. In particular, is it true that$f_c(n)>n^{\epsilon}$for some$\epsilon>0$? Or$f_c(n)\gg \log n$? A problem of Erdős and Rothschild. Alon and Trotter showed that, provided$c<1/4$,$f_c(n)\ll_c n^{1/2}$. Szemerédi observed that his regularity lemma implies that$f_c(n)\to \infty$. Edwards (unpublished) and Khadziivanov and Nikiforov [KhNi79] proved indepedently that$f_c(n) \geq n/6$when$c>1/4$. Fox and Loh [FoLo12] proved that $f_c(n) \leq n^{O(1/\log\log n)}$ for all$c<1/4$, disproving the first conjecture of Erdős. The best known lower bounds for$f_c(n)$are those from Szemerédi's regularity lemma, and as such remain very poor. See also [600] and the entry in the graphs problem collection. Additional thanks to: Zach Hunter OPEN Let$G$be a chordal graph on$n$vertices - that is,$G$has no induced cycles of length greater than$3$. Can the edges of$G$be partitioned into$n^2/6+O(n)$many cliques? Asked by Erdős, Ordman, and Zalcstein [EOZ93], who proved an upper bound of$(1/4-\epsilon)n^2$many cliques (for some very small$\epsilon>0$). The example of all edges between a complete graph on$n/3$vertices and an empty graph on$2n/3$vertices show that$n^2/6+O(n)$is sometimes necessary. A split graph is one where the vertices can be split into a clique and an independent set. Every split graph is chordal. Chen, Erdős, and Ordman [CEO94] have shown that any split graph can be partitioned into$\frac{3}{16}n^2+O(n)$many cliques. OPEN Let$F(n)$be maximal such that every graph on$n$vertices contains a regular induced subgraph on at least$F(n)$vertices. Prove that$F(n)/\log n\to \infty$. Conjectured by Erdős, Fajtlowicz, and Stanton. It is known that$F(5)=3$and$F(7)=4$. Ramsey's theorem implies that$F(n)\gg \log n$. Bollobás observed that$F(n)\ll n^{1/2+o(1)}$. Alon, Krivelevich, and Sudakov [AKS07] have improved this to$n^{1/2}(\log n)^{O(1)}$. Additional thanks to: Zachary Hunter OPEN The cycle set of a graph$G$on$n$vertices is a set$A\subseteq \{3,\ldots,n\}$such that there is a cycle in$G$of length$\ell$if and only if$\ell \in A$. Let$f(n)$count the number of possible such$A$. Prove that$f(n)=o(2^n)$. Prove that$f(n)/2^{n/2}\to \infty$. Conjectured by Erdős and Faudree, who showed that$2^{n/2}<f(n) \leq 2^{n-2}$. The first problem was solved by Verstraëte [Ve04], who proved $f(n)\ll 2^{n-n^c}$ for some constant$c>0$. One can also ask about the existence and value of$\lim f(n)^{1/n}$. Additional thanks to: Tuan Tran OPEN Let$f(n)$be such that every graph on$n$vertices with minimal degree$\geq f(n)$contains a$C_4$. Is it true that$f(n+1)\geq f(n)$? A weaker version of the conjecture asks for some constant$c$such that$f(m)>f(n)-c$for all$m>n$. This question can be asked for other graphs than$C_4$. OPEN -$100
Let $Q_n$ be the $n$-dimensional hypercube graph (so that $Q_n$ has $2^n$ vertices and $n2^{n-1}$ edges). Is it true that every subgraph of $Q_n$ with $\geq \left(\frac{1}{2}+o(1)\right)n2^{n-1}$ many edges contains a $C_4$?
The best known result is due to Balogh, Hu, Lidicky, and Liu [BHLL14], who proved that $0.6068 n2^{n-1}$ edges suffice. Erdős [Er91] observes that there exist subgraphs with $\geq \left(\frac{1}{2}+\frac{c}{n}\right)n2^{n-1}$ many edges without a $C_4$ (for some constant $c>0$). He suggests that it 'perhaps not hopeless' to determine the threshold exactly.

A similar question can be asked for other even cycles.

OPEN
Let $\epsilon >0$. Is it true that, if $k$ is sufficiently large, then $R(G)>(1-\epsilon)^kR(k)$ for every graph $G$ with chromatic number $\chi(G)=k$?

Even stronger, is there some $c>0$ such that, for all large $k$, $R(G)>cR(k)$ for every graph $G$ with chromatic number $\chi(G)=k$?

Erdős originally conjectured that $R(G)\geq R(k)$, which is trivial for $k=3$, but fails already for $k=4$, as Faudree and McKay [FaMc93] showed that $R(W)=17$ for the pentagonal wheel $W$.

Since $R(k)\leq 4^k$ this is trivial for $\epsilon\geq 3/4$. Yuval Wigderson points out that $R(G)\gg 2^{k/2}$ for any $G$ with chromatic number $k$ (via a random colouring), which asymptotically matches the best-known lower bounds for $R(k)$.

This problem is #12 and #13 in Ramsey Theory in the graphs problem collection.

SOLVED - $100 For any$\epsilon>0$there exists$\delta=\delta(\epsilon)>0$such that if$G$is a graph on$n$vertices with no independent set or clique of size$\geq \epsilon\log n$then$G$contains an induced subgraph with$m$edges for all$m\leq \delta n^2$. Conjectured by Erdős and McKay, who proved it with$\delta n^2$replaced by$\delta (\log n)^2$. Solved by Kwan, Sah, Sauermann, and Sawhney [KSSS22]. Erdős' original formulation also had the condition that$G$has$\gg n^2$edges, but an old result of Erdős and Szemerédi says that this follows from the other condition anyway. Additional thanks to: Zachary Hunter and Mehtaab Sawhney OPEN For every$r\geq 4$and$k\geq 2$is there some finite$f(k,r)$such that every graph of chromatic number$\geq f(k,r)$contains a subgraph of girth$\geq r$and chromatic number$\geq k$? Conjectured by Erdős and Hajnal. Rödl [Ro77] has proved the$r=4$case. The infinite version (whether every graph of infinite chromatic number contains a subgraph of infinite chromatic number whose girth is$>k$) is also open. In [Er79b] Erdős also asks whether $\lim_{k\to \infty}\frac{f(k,r+1)}{f(k,r)}=\infty.$ OPEN Is there some$F(n)$such that every graph with chromatic number$\aleph_1$has, for all large$n$, a subgraph with chromatic number$n$on at most$F(n)$vertices? Conjectured by Erdős, Hajnal, and Szemerédi [EHS82]. This fails if the graph has chromatic number$\aleph_0$. OPEN If$G$is a graph let$h_G(n)$be defined such that any subgraph of$G$on$n$vertices can be made bipartite after deleting at most$h_G(n)$edges. What is the behaviour of$h_G(n)$? Is it true that$h_G(n)/n\to \infty$for every graph$G$with chromatic number$\aleph_1$? A problem of Erdős, Hajnal, and Szemerédi [EHS82]. Every$G$with chromatic number$\aleph_1$must have$h_G(n)\gg n$since$G$must contain, for some$r$,$\aleph_1$many vertex disjoint odd cycles of length$2r+1$. On the other hand, Erdős, Hajnal, and Szemerédi proved that there is a$G$with chromatic number$\aleph_1$such that$h_G(n)\ll n^{3/2}$. In [Er81] Erdős conjectures that this can be improved to$\ll n^{1+\epsilon}$for every$\epsilon>0$. See also [74]. OPEN Let$k=k(n,m)$be minimal such that any directed graph on$k$vertices must contain either an independent set of size$n$or a directed path of size$m$. Determine$k(n,m)$. A problem of Erdős and Rado [ErRa67], who showed $k(n,m) \leq \frac{2^{m-1}(n-1)^m+n-2}{2n-3}.$ Larson and Mitchell [LaMi97] prove that$k(n,m)\leq n^{m-1}$for$m\geq 3$. SOLVED -$250
If $G$ is bipartite then $\mathrm{ex}(n;G)\ll n^{3/2}$ if and only $G$ is $2$-degenerate, that is, $G$ contains no induced subgraph with minimal degree at least 3.
Conjectured by Erdős and Simonovits. Erdős offered \$250 for a proof and \$100 for a counterexample. 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 [146] and [147] and the entry in the graphs problem collection.

SOLVED
Let $f(m)$ be maximal such that every graph with $m$ edges must contain a bipartite graph with $\geq \frac{m}{2}+\frac{\sqrt{8m+1}-1}{8}+f(m)$ edges. Is there an infinite sequence of $m_i$ such that $f(m_i)\to \infty$?
Conjectured by Erdős, Kohayakava, and Gyárfás. Edwards [Ed73] proved that $f(m)\geq 0$ always. Note that $f(\binom{n}{2})= 0$, taking $K_n$. Solved by Alon [Al96], who showed $f(n^2/2)\gg n^{1/2}$, and also showed that $f(m)\ll m^{1/4}$ for all $m$. The best possible constant in $f(m)\leq Cm^{1/4}$ is unknown.
OPEN - $250 Let$G$be a graph with$n$vertices such that every subgraph on$\geq n/2$vertices has more than$n^2/50$edges. Must$G$contain a triangle? A problem of Erdős and Rousseau. The constant$50$would be best possible as witnessed by a blow-up of$C_5$or the Petersen graph. Krivelevich [Kr95] has proved this with$n/2$replaced by$3n/5$(and$50$replaced by$25$). Keevash and Sudakov [KeSu06] have proved this under the additional assumption that$G$has at most$n^2/12$edges. Additional thanks to: Boris Alexeev OPEN Let$R(n;k,r)$be the smallest$N$such that if the edges of$K_N$are$r$-coloured then there is a set of$n$vertices which does not contain a copy of$K_k$in at least one of the$r$colours. Prove that there is a constant$C=C(r)>1$such that $R(n;3,r) < C^{\sqrt{n}}.$ Conjectured by Erdős and Gyárfás, who proved the existence of some$C>1$such that$R(n;3,r)>C^{\sqrt{n}}$. Note that when$r=k=2$we recover the classic Ramsey numbers. Erdős thought it likely that for all$r,k\geq 2$there exists some$C_1,C_2>1$(depending only on$r$) such that $C_1^{n^{1/k-1}}< R(n;k,r) < C_2^{n^{1/k-1}}.$ Antonio Girao has pointed out that this problem as written is easily disproved, and indeed$R(n;3,2) \geq C^{n}$: The obvious probabilistic construction (randomly colour the edges red/blue independently uniformly at random) yields a 2-colouring of the edges of$K_N$such every set on$n$vertices contains a red triangle and a blue triangle (using that every set of$n$vertices contains$\gg n^2$edge-disjoint triangles), provided$N \leq C^n$for some absolute constant$C>1$. This implies$R(n;3,2) \geq C^{n}$, contradicting the conjecture. Perhaps Erdős had a different problem in mind, but it is not clear what that might be. It would presumably be one where the natural probabilistic argument would deliver a bound like$C^{\sqrt{n}}$as Erdős and Gyárfás claim to have achieved via the probabilistic method. Additional thanks to: Antonio Girao OPEN Let$A\subset\mathbb{R}^2$be an infinite set which contains no three points on a line and no four points on a circle. Consider the graph with vertices the points in$A$, where two vertices are joined by an edge if and only if they are an integer distance apart. How large can the chromatic number and clique number of this graph be? In particular, can the chromatic number be infinite? Asked by Andrásfai and Erdős. Erdős [Er97b] also asked where such a graph could contain an infinite complete graph, but this is impossible by an earlier result of Anning and Erdős [AnEr45]. See also [213]. Additional thanks to: Noga Alon SOLVED Let$f(n)$be minimal such that every triangle-free graph$G$with$n$vertices and diameter$2$contains a vertex with degree$\geq f(n)$. What is the order of growth of$f(n)$? Does$f(n)/\sqrt{n}\to \infty$? Asked by Erdős and Pach. The lower bound$f(n)\geq (1-o(1))\sqrt{n}$follows from the fact that a graph with maximum degree$d$and diameter$2$has at most$1+d+d(d-1)=d^2+1$many vertices. Simonovits observed that the subsets of$[3m-1]$of size$m$, two sets joined by edge if and only if they are disjoint, forms a triangle-free graph of diameter$2$which is regular of degree$\binom{2m-1}{m}$. This construction proves that $f(n) \leq n^{(1+o(1))\frac{2}{3H(1/3)}}=n^{0.7182\cdots},$ where$H(x)$is the binary entropy function. In [Er97b] Erdős encouraged the reader to try and find a better construction. In this note Alon provides a simple construction that proves$f(n) \ll \sqrt{n\log n}$: take a triangle-free graph with independence number$\ll \sqrt{n\log n}$(the existence of which is the lower bound in [165]) and add edges until it has diameter$2$; the neighbourhood of any set is an independent set and hence the maximum degree is still$\ll \sqrt{n\log n}$. Hanson and Seyffarth [HaSe84] proved that$f(n)\leq (\sqrt{2}+o(1))\sqrt{n}$using a Cayley graph on$\mathbb{Z}/n\mathbb{Z}$, with the generating set given by some symmetric complete sum-free set of size$\sim \sqrt{n}$. An alternative construction of such a complete sum-free set was given by Haviv and Levy [HaLe18]. Füredi and Seress [FuSe94] proved that$f(n)\leq (\frac{2}{\sqrt{3}}+o(1))\sqrt{n}$. The precise asymptotics of$f(n)$are unknown; Alon believes that the truth is$f(n)\sim \sqrt{n}$. Additional thanks to: Noga Alon, Ishay Haviv SOLVED Let$\epsilon,\delta>0$and$n$be sufficiently large in terms of$\epsilon$and$\delta$. Let$G$be a triangle-free graph on$n$vertices with maximum degree$<n^{1/2-\epsilon}$. Can$G$be made into a triangle-free graph with diameter$2$by adding at most$\delta n^2$edges? Asked by Erdős and Gyárfás, who proved that this is the case when$G$has maximum degree$\ll \log n/\log\log n$. A construction of Simonovits shows that this conjecture is false if we just have maximum degree$\leq Cn^{1/2}$, for some large enough$C$. In this note Alon solves this problem in a strong form, in particular proving that a triangle-free graph on$n$vertices with maximum degree$<n^{1/2-\epsilon}$can be made into a triangle-free graph with diameter$2$by adding at most$O(n^{2-\epsilon})$edges. See also [618]. Additional thanks to: Noga Alon SOLVED Let$f(n)$be the smallest number of colours required to colour the edges of$K_n$such that every$K_4$contains at least 5 colours. Determine the size of$f(n)$. Asked by Erdős and Gyárfás, who proved that $\frac{5}{6}(n-1) < f(n)<n,$ and that$f(9)=8$. Erdős believed the upper bound is closer to the truth. In fact the lower bound is: Bennett, Cushman, Dudek,and Pralat [BCDP22] have shown that $f(n) \sim \frac{5}{6}n.$ Joos and Mubayi [JoMu22] have found a shorter proof of this. 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 Let$G$be a graph of maximum degree$\Delta$. Is$G$the union of at most$\tfrac{5}{4}\Delta^2$sets of strongly independent edges (sets such that the induced subgraph is the union of vertex-disjoint edges)? Asked by Erdős and Nešetřil in 1985 (see [FGST89]). This bound would be the best possible, as witnessed by a blowup of$C_5$. The minimum number of such sets required is sometimes called the strong chromatic index of$G$. The weaker conjecture that there exists some$c>0$such that$(2-c)\Delta^2$sets suffice was proved by Molloy and Reed [MoRe97], who proved that$1.998\Delta^2$sets suffice (for$\Delta$sufficiently large). This was improved to$1.93\Delta^2$by Bruhn and Joos [BrJo18] and to$1.835\Delta^2$by Bonamy, Perrett, and Postle [BPP22]. Erdős and Nešetřil also asked the easier problem of whether$G$containing at least$\tfrac{5}{4}\Delta^2$many edges implies$G$containing two strongly independent edges. This was proved independently by Chung-Trotter and Gyárfás-Tuza. Additional thanks to: David Penman OPEN A minimal cut of a graph is a minimal set of vertices whose removal disconnects the graph. Let$c(n)$be the maximum number of minimal cuts a graph on$n$vertices can have. Is$c(3m+2)=3^m$? Does$c(n)^{1/n}\to \alpha$for some$\alpha <2$? Asked by Erdős and Nešetřil. Seymour observed that$c(3m+2)\geq 3^m$, as seen by the graph of$m$independent paths of length$4$joining two vertices. OPEN Let$h(n)$be minimal such that, for every graph$G$on$n$vertices, there is a set of vertices$X$of size$\lvert X\rvert\leq h(n)$such that every maximal clique (on at least$2$vertices) in$G$contains at least one vertex from$X$. Let$H(n)$be maximal such that every triangle-free graph on$n$vertices contains an independent set on$H(n)$vertices. Does$h(n)=n-H(n)$? It is easy to see that$h(n)\leq n-\sqrt{n}$and that$h(n)\leq n-H(n)$. Conjectured by Erdős and Gallai, who were unable to make progress even assuming$G$is$K_4$-free. Erdős remarked that this conjecture is 'perhaps completely wrongheaded'. Additional thanks to: Zachary Chase OPEN There exists some constant$c>0$such that $$R(C_4,K_n) \ll n^{2-c}.$$ The current bounds are $\frac{n^{3/2}}{(\log n)^{3/2}}\ll R(C_4,K_n)\ll \frac{n^2}{(\log n)^2}.$ The upper bound is due to Szemerédi (mentioned in [EFRS78]), and the lower bound is due to Spencer [Sp77]. This problem is #17 in Ramsey Theory in the graphs problem collection. SOLVED For any$d\geq 1$if$H$is a graph such that every subgraph contains a vertex of degree at most$d$then$R(H)\ll_d n$. The Burr-Erdős conjecture. This is equivalent to showing that if$H$is the union of$c$forests then$R(H)\ll_c n$, and also that if every subgraph has average degree at most$d$then$R(H)\ll_d n$. Solved by Lee [Le16], who proved that $R(H) \leq 2^{2^{O(d)}}n.$ This problem is #9 in Ramsey Theory in the graphs problem collection. See also [800]. OPEN -$250
Give an asymptotic formula for $R(3,k)$.
It is known that there exists some constant $c>0$ such that for large $k$ $c\frac{k^2}{\log k}\leq R(3,k) \leq (1+o(1))\frac{k^2}{\log k}.$ The lower bound is due to Kim [Ki95], the upper bound is due to Shearer [Sh83], improving an earlier bound of Ajtai, Komlós, and Szemerédi [AjKoSz80]. The lower bound has been improved to $\left(\frac{1}{4}-o(1)\right)\frac{k^2}{\log k}$ independently by Bohman and Keevash [BoKe21] and Pontiveros, Griffiths and Morris [PGM20]. The latter collection of authors conjecture that this lower bound is the true order of magnitude.

SOLVED - $250 Prove that $R(4,k) \gg \frac{k^3}{(\log k)^{O(1)}}.$ Spencer [Sp77] proved $R(4,k) \gg (k\log k)^{5/2}.$ Ajtai, Komlós, and Szemerédi [AKS80] proved $R(4,k) \ll \frac{k^3}{(\log k)^2}.$ This is true, and was proved by Mattheus and Verstraete [MaVe23], who showed that $R(4,k) \gg \frac{k^3}{(\log k)^4}.$ This problem is #5 in Ramsey Theory in the graphs problem collection. OPEN If$G$is a graph with at most$k$edge disjoint triangles then can$G$be made triangle-free after removing at most$2k$edges? A problem of Tuza. It is trivial that$G$can be made triangle-free after removing at most$3k$edges. The examples of$K_4$and$K_5$show that$2k$would be best possible. OPEN If$\mathcal{F}$is a finite set of finite graphs then$\mathrm{ex}(n;\mathcal{F})$is the maximum number of edges a graph on$n$vertices can have without containing any subgraphs from$\mathcal{F}$. Note that it is trivial that$\mathrm{ex}(n;\mathcal{F})\leq \mathrm{ex}(n;G)$for every$G\in\mathcal{F}$. Is it true that, for every$\mathcal{F}$, there exists$G\in\mathcal{F}$such that $\mathrm{ex}(n;G)\ll_{\mathcal{F}}\mathrm{ex}(n;\mathcal{F})?$ A problem of Erdős and Simonovits. This is trivially true if$\mathcal{F}$does not contain any bipartite graphs, since by the Erdős-Stone theorem if$H\in\mathcal{F}$has minimal chromatic number$r\geq 2$then $\mathrm{ex}(n;H)=\mathrm{ex}(n;\mathcal{F})=\left(\frac{r-2}{r-1}+o(1)\right)\binom{n}{2}.$ Erdős and Simonovits observe that this is false for infinite families$\mathcal{F}$, e.g. the family of all cycles. See also [575] and the entry in the graphs problem collection. OPEN Let$Q_n$be the$n$-dimensional hypercube graph (so that$Q_n$has$2^n$vertices and$n2^{n-1}$edges). Prove that $R(Q_n) \ll 2^n.$ Conjectured by Burr and Erdős. The trivial bound is $R(Q_n) \leq R(K_{2^n})\leq C^{2^n}$ for some constant$C>1$. This was improved a number of times; the current best bound due to Tikhomirov [Ti22] is $R(Q_n)\ll 2^{(2-c)n}$ for some small constant$c>0$. (In fact$c\approx 0.03656$is permissible.) SOLVED Let$k\geq 3$. What is the maximum number of edges that a graph on$n$vertices can contain if it does not have a$k$-regular subgraph? Is it$\ll n^{1+o(1)}$? Asked by Erdős and Sauer. Resolved by Janzer and Sudakov [JaSu22], who proved that there exists some$C=C(k)>0$such that any graph on$n$vertices with at least$Cn\log\log n$edges contains a$k$-regular subgraph. A construction due to Pyber, Rödl, and Szemerédi [PRS95] shows that this is best possible. Additional thanks to: Antonio Girao OPEN -$250
Let $R(3;k)$ be the minimal $n$ such that if the edges of $K_n$ are coloured with $k$ colours then there must exist a monochromatic triangle. Determine $\lim_{k\to \infty}R(3;k)^{1/k}.$
Erdős offers \$100 for showing that this limit is finite. An easy pigeonhole argument shows that $R(3;k)\leq 2+k(R(3;k-1)-1),$ from which$R(3;k)\leq \lceil e k!\rceil$immediately follows. The best-known upper bounds are all of the form$ck!+O(1)$, and arise from this type of inductive relationship and computational bounds for$R(3;k)$for small$k$. The best-known lower bound (coming from lower bounds for Schur numbers) is due to Exoo [Ex94], $R(3;k) \gg (321)^{k/5}.$ See also [483]. Additional thanks to: Antonio Girao, David Penman OPEN Any graph on$n$vertices can be decomposed into$O(n)$many cycles and edges. Conjectured by Erdős and Gallai, who proved that$O(n\log n)$many cycles and edges suffices. The best bound available is due to Bucić and Montgomery [BM22], who prove that$O(n\log^*n)$many cycles and edges suffice, where$\log^*$is the iterated logarithm function. Conlon, Fox, and Sudakov [CFS14] proved that$O_\epsilon(n)$cycles and edges suffice if$G$has minimum degree at least$\epsilon n$, for any$\epsilon>0$. See also [583]. OPEN -$100
We say $H$ is a unique subgraph of $G$ if there is exactly one way to find $H$ as a subgraph (not necessarily induced) of $G$. Is there a graph on $n$ vertices with $\gg \frac{2^{\binom{n}{2}}}{n!}$ many distinct unique subgraphs?
A problem of Erdős and Entringer [EnEr72], who constructed a graph with $\gg 2^{\binom{n}{2}-O(n^{3/2+o(1)})}$ many unique subgraphs. This was improved by Harary and Schwenk [HaSc73] and then by Brouwer [Br75], who constructed a graph with $\gg \frac{2^{\binom{n}{2}-O(n)}}{n!}$ many unique subgraphs.

Note that there are $\sim 2^{\binom{n}{2}}/n!$ many non-isomorphic graphs on $n$ vertices (folklore, often attributed to Pólya), and hence the bound in the problem statement is trivially best possible.

Erdős believed Brouwer's construction was essentially best possible, but Spencer suggested that $\gg \frac{2^{\binom{n}{2}}}{n!}$ may be possible. Erdős offered \$100 for a construction and \$25 for a proof that no such construction is possible.

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 Let$\delta>0$. If$n$is sufficiently large and$G$is a graph on$n$vertices with no$K_5$and at least$\delta n^2$edges then$G$contains a set of$\gg_\delta n$vertices containing no triangle. A problem of Erdős, Hajnal, Simonovits, Sós, and Szemerédi, who could prove this is true for$\delta>1/16$, and could further prove it for$\delta>0$if we replace$K_5$with$K_4$. They further observed that it fails for$\delta =1/4$if we replace$K_5$with$K_7$: by a construction of Erdős and Rogers [ErRo62] (see [620]) there exists some constant$c>0$such that, for all large$n$, there is a graph on$n$vertices which contains no$K_4$and every set of at least$n^{1-c}$vertices contains a triangle. If we take two vertex disjoint copies of this graph and add all edges between the two copies then this yields a graph on$2n$vertices with$\geq n^2$edges, which contains no$K_7$, yet every set of at least$2n^{1-c}$vertices contains a triangle. See also [579] and the entry in the graphs problem collection. Additional thanks to: Noga Alon OPEN Show that $R(3,k+1)-R(3,k)\to\infty$ as$k\to \infty$. Similarly, prove or disprove that $R(3,k+1)-R(3,k)=o(k).$ This problem is #8 in Ramsey Theory in the graphs problem collection. See also [165]. OPEN Show that if$G$has$\binom{n}{2}$edges then $R(G) \leq R(n).$ More generally, if$G$has$\binom{n}{2}+t$edges with$t\leq n$then $R(G)\leq R(H)$ where$H$is the graph formed by connected a new vertex to$t$of the vertices of$K_n$. In other words, are cliques extremal for Ramsey numbers. Asked by Erdős and Graham. This problem is #10 in Ramsey Theory in the graphs problem collection. SOLVED Is it true that if$G$has$m$edges then $R(G) \leq 2^{O(m^{1/2})}?$ This is true, and was proved by Sudakov [Su11]. The analogous question for$\geq 3$colours is still open. This problem is #11 in Ramsey Theory in the graphs problem collection. Additional thanks to: Zach Hunter OPEN If$T$is a tree on$n$vertices then $R(T) \leq 2n-2.$ Equality holds when$T$is a star on$n$vertices. Implied by [548]. This problem is #14 in Ramsey Theory in the graphs problem collection. OPEN Let$n\geq k+1$. Every graph on$n$vertices with at least$\frac{k-1}{2}n+1$edges contains every tree on$k+1$vertices. A problem of Erdős and Sós, who also conjectured that every graph with at least $\max\left( \binom{2k-1}{2}+1, (k-1)n-(k-1)^2+\binom{k-1}{2}+1\right)$ many edges contains every forest with$k$edges. (Erdős and Gallai [ErGa59] proved that this is the threshold which guarantees containing$k$independent edges.) It can be easily proved by induction that every graph on$n$vertices with at least$n(k-1)+1$edges contains every tree on$k+1$vertices. Brandt and Dobson [BrDo96] have proved this for graphs of girth at least$5$. Wang, Li, and Liu [WLL00] have proved this for graphs whose complements have girth at least$5$. Saclé and Woznik [SaWo97] have proved this for graphs which contain no cycles of length$4$. Yi and Li [YiLi04] have proved this for graphs whose complements contain no cycles of length$4$. Implies [547] and [557]. SOLVED If$T$is a tree which is a bipartite graph with$k$vertices and$2k$vertices in the other class then show that$R(T)=4k$. It follows from results in [EFRS82] that$R(T)\geq 4k-1$. This is false: Norin, Sun, and Zhao [NSZ16] have proved that if$T$is the union of two stars on$k$and$2k$vertices, with an edge joining the centre of the two stars, then$R(T)\geq (4.2-o(1))k$. The best upper bound for the Ramsey number for this tree is$R(T)\leq 4.27492k+1$, obtained by Dubó and Stein [DuSt24]. This problem is #15 in Ramsey Theory in the graphs problem collection. Additional thanks to: Zach Hunter OPEN Let$m_1\leq\cdots\leq m_k$and$n$be sufficiently large. If$T$is a tree on$n$vertices and$G$is the complete multipartite graph with vertex class sizes$m_1,\ldots,m_k$then prove that $R(T,G)\leq (\chi(G)-1)(R(T,K_{m_1,m_2})-1)+m_1.$ Chvátal [Ch77] proved that$R(T,K_m)=(m-1)(n-1)+1$. This problem is #16 in Ramsey Theory in the graphs problem collection. SOLVED Prove that $R(C_k,K_n)=(k-1)(n-1)+1$ for$k\geq n\geq 3$(except when$n=k=3$). Asked by Erdős, Faudree, Rousseau, and Schelp, who also ask for the smallest value of$k$such that this identity holds (for fixed$n$). They also ask, for fixed$n$, what is the minimum value of$R(C_k,K_n)$? This identity was proved for$k>n^2-2$by Bondy and Erdős [BoEr73]. Nikiforov [Ni05] extended this to$k\geq 4n+2$. Keevash, Long, and Skokan [KLS21] have proved this identity when$k\geq C\frac{\log n}{\log\log n}$for some constant$C$, thus establishing the conjecture for sufficiently large$n$. OPEN Determine $R(C_4,S_n),$ where$S_n$is the star on$n+1$vertices. It was shown in [BEFRS89] that $n+\lceil\sqrt{n}\rceil+1\geq R(C_4,S_n)\geq n+\sqrt{n}-6n^{11/40}.$ Füredi (unpublished) has shown that$R(C_4,S_n)=n+\lceil\sqrt{n}\rceil$for infinitely many$n$. SOLVED Let$R(3,3,n)$denote the smallest integer$m$such that if we$3$-colour the edges of$K_m$then there is either a monochromatic triangle in one of the first two colours or a monochromatic$K_n$in the third colour. Define$R(3,n)$similarly but with two colours. Show that $\frac{R(3,3,n)}{R(3,n)}\to \infty$ as$n\to \infty$. A problem of Erdős and Sós. This was solved by Alon and Rödl [AlRo05], who in fact show that $R(3,3,n)\asymp n^3(\log n)^{O(1)}$ (recalling that Shearer [Sh83] showed$R(3,n) \ll n^2/\log n$). OPEN Let$R(G;k)$denote the minimal$m$such that if the edges of$K_m$are$k$-coloured then there is a monochromatic copy of$G$. Show that $\lim_{k\to \infty}\frac{R(C_{2n+1};k)}{R(K_3;k)}=0$ for any$n\geq 2$. A problem of Erdős and Graham. The problem is open even for$n=2$. OPEN Let$R(G;k)$denote the minimal$m$such that if the edges of$K_m$are$k$-coloured then there is a monochromatic copy of$G$. Determine the value of $R(C_{2n};k).$ A problem of Erdős and Graham. Erdős [Er81c] gives the bounds $k^{1+\frac{1}{2n}}\ll R(C_{2n};k)\ll k^{1+\frac{1}{n-1}}.$ Chung and Graham [ChGr75] showed that $R(C_4;k)>k^2-k+1$ when$k-1$is a prime power and $R(C_4;k)\leq k^2+k+1$ for all$k$. SOLVED Let$R(G;3)$denote the minimal$m$such that if the edges of$K_m$are$3$-coloured then there must be a monochromatic copy of$G$. Show that $R(C_n;3) \leq 4n-3.$ A problem of Bondy and Erdős. This inequality is best possible for odd$n$. Luczak [Lu99] has shown that$R(C_n;3)\leq (4+o(1))n$for all$n$, and in fact$R(C_n;3)\leq 3n+o(n)$for even$n$. Kohayakawa, Simonovits, and Skokan [KSS05] proved this conjecture when$n$is sufficiently large and odd. Benevides and Skokan [BeSk09] proved that if$n$is sufficiently large and even then$R(C_n;3)=2n$. OPEN Let$R(G;k)$denote the minimal$m$such that if the edges of$K_m$are$k$-coloured then there is a monochromatic copy of$G$. Is it true that $R(T;k)=kn+O(1)$ for any tree$T$on$n$vertices? A problem of Erdős and Graham. Implied by [548]. OPEN Let$R(G;k)$denote the minimal$m$such that if the edges of$K_m$are$k$-coloured then there is a monochromatic copy of$G$. Determine $R(K_{s,t};k)$ where$K_{s,t}$is the complete bipartite graph with$s$vertices in one component and$t$in the other. Chung and Graham [ChGr75] prove the general bounds $(2\pi\sqrt{st})^{\frac{1}{s+t}}\left(\frac{s+t}{e^2}\right)k^{\frac{st-1}{s+t}}\leq R(K_{s,t};k)\leq (t-1)(k+k^{1/s})^s$ and determined $R(K_{2,2},k)=(1+o(1))k^2.$ Alon, Rónyai, and Szabó [ARS99] have proved that $R(K_{3,3},k)=(1+o(1))k^3$ and that if$s\geq (t-1)!+1$then $R(K_{s,t},k)\asymp k^t.$ Additional thanks to: Noga Alon SOLVED Let$\hat{R}(G)$denote the size Ramsey number, the minimal number of edges$m$such that there is a graph$H$with$m$edges that is Ramsey for$G$. If$G$has$n$vertices and maximum degree$d$then prove that $\hat{R}(G)\ll_d n.$ A problem of Beck and Erdős. Beck [Be83b] proved this when$G$is a path. Friedman and Pippenger [FrPi87] proved this when$G$is a tree. Haxell, Kohayakawa, and Luczak [HKL95] proved this when$G$is a cycle. An alternative proof when$G$is a cycle (with better constants) was given by Javadi, Khoeini, Omidi, and Pokrovskiy [JKOP19]. This was disproved for$d=3$by Rödl and Szemerédi [RoSz00], who constructed a graph on$n$vertices with maximum degree$3$such that $\hat{R}(G)\gg n(\log n)^{c}$ for some absolute constant$c>0$. Tikhomirov [Ti22b] has improved this to $\hat{R}(G)\gg n\exp(c\sqrt{\log n}).$ It is an interesting question how large$\hat{R}(G)$can be if$G$has maximum degree$3$. Kohayakawa, Rödl, Schacht, and Szemerédi [KRSS11] proved an upper bound of$\leq n^{5/3+o(1)}$and Conlon, Nenadov, and Trujić [CNT22] proved$\ll n^{8/5}$. The best known upper bound of$\leq n^{3/2+o(1)}$is due to Draganić and Petrova [DrPe22]. Additional thanks to: Zach Hunter OPEN Let$\hat{R}(G)$denote the size Ramsey number, the minimal number of edges$m$such that there is a graph$H$with$m$edges such that in any$2$-colouring of the edges of$H$there is a monochromatic copy of$G$. Determine $\hat{R}(K_{n,n}),$ where$K_{n,n}$is the complete bipartite graph with$n$vertices in each component. We know that $\frac{1}{60}n^22^n<\hat{R}(K_{n,n})< \frac{3}{2}n^32^n.$ The lower bound (which holds for$n\geq 6$) was proved by Erdős and Rousseau [ErRo93]. The upper bound was proved by Erdős, Faudree, Rousseau, and Schelp [EFRS78b] and Nešetřil and Rödl [NeRo78]. Conlon, Fox, and Wigderson [CFW23] have proved that, for any$s\leq t$, $\hat{R}(K_{s,t})\gg s^{2-\frac{s}{t}}t2^s,$ and prove that when$t\gg s\log s$we have$\hat{R}(K_{s,t})\asymp s^2t2^s$. They conjecture that this should hold for all$s\leq t$, and so in particular we should have$\hat{R}(K_{n,n})\asymp n^32^n$. OPEN Let$\hat{R}(G)$denote the size Ramsey number, the minimal number of edges$m$such that there is a graph$H$with$m$edges such that in any$2$-colouring of the edges of$H$there is a monochromatic copy of$G$. Let$F_1$and$F_2$be the union of stars. More precisely, let$F_1=\cup_{i\leq s} K_{1,n_i}$and$F_2=\cup_{j\leq t} K_{1,m_j}$. Prove that $\hat{R}(F_1,F_2) = \sum_{2\leq k\leq s+2}\max\{n_i+m_j-1 : i+j=k\}.$ Burr, Erdős, Faudree, Rousseau, and Schelp [BEFRS78] proved this when all the$n_i$are identical and all the$m_i$are identical. OPEN Let$R_r(n)$denote the$r$-uniform hypergraph Ramsey number: the minimal$m$such that if we$2$-colour all edges of the complete$r$-uniform hypergraph on$m$vertices then there must be some monochromatic copy of the complete$r$-uniform hypergraph on$n$vertices. Prove that, for$r\geq 3$, $\log_{r-1} R_r(n) \asymp_r n,$ where$\log_{r-1}$denotes the$(r-1)$-fold iterated logarithm. That is, does$R_r(n)$grow like $2^{2^{\cdots n}}$ where the tower of exponentials has height$r-1$? A problem of Erdős, Hajnal, and Rado [EHR65]. A generalisation of [564]. OPEN Let$F(n,\alpha)$denote the largest$m$such that there exists a$2$-colouring of the edges of$K_n$so that every$X\subseteq [n]$with$\lvert X\rvert\geq m$contains more than$\alpha \binom{\lvert X\rvert}{2}$many edges of each colour. Prove that, for every$0\leq \alpha\leq 1/2$, $F(n,\alpha)\sim c_\alpha\log n$ for some constant$c_\alpha$depending only on$\alpha$. It is easy to show that, for every$0\leq \alpha\leq 1/2$, $F(n,\alpha)\asymp_\alpha \log n.$ Note that when$\alpha=0$this is just asking for a$2$-colouring of the edges of$K_n$which contains no monochromatic clique of size$m$, and hence we recover the classical Ramsey numbers. See also [161]. 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
Let $R^*(G)$ be the induced Ramsey number: the minimal $m$ such that there is a graph $H$ on $m$ vertices such that any $2$-colouring of the edges of $H$ contains an induced monochromatic copy of $G$.

Is it true that $R^*(G) \leq 2^{O(n)}$ for any graph $G$ on $n$ vertices?

A problem of Erdős and Rödl. Even the existence of $R^*(G)$ is not obvious, but was proved independently by Deuber [De75], Erdős, Hajnal, and Pósa [EHP75], and Rödl [Ro73].

Rödl [Ro73] proved this when $G$ is bipartite. Kohayakawa, Prömel, and Rödl [KPR98] have proved that $R^*(G) < 2^{O(n(\log n)^2)}.$ An alternative (and more explicit) proof was given by Fox and Sudakov [FoSu08]. Conlon, Fox, and Sudakov [CFS12] have improved this to $R^*(G) < 2^{O(n\log n)}.$

OPEN
Let $G$ be such that any subgraph on $k$ vertices has at most $2k-3$ edges. Is it true that, if $H$ has $m$ edges and no isolated vertices, then $R(G,H)\ll m?$
In other words, is $G$ Ramsey size linear? This fails for a graph $G$ with $n$ vertices and $2n-2$ edges (for example with $H=K_n$). Erdős, Faudree, Rousseau, and Schelp [EFRS93] have shown that any graph $G$ with $n$ vertices and at most $n+1$ edges is Ramsey size linear.

Implies [567].

OPEN
Let $G$ be either $Q_3$ or $K_{3,3}$ or $H_5$ (the last formed by adding two vertex-disjoint chords to $C_5$). Is it true that, if $H$ has $m$ edges and no isolated vertices, then $R(G,H)\ll m?$
In other words, is $G$ Ramsey size linear? A special case of [566]. In [Er95] Erdős specifically asks about the case $G=K_{3,3}$.

The graph $H_5$ can also be described as $K_4^*$, obtained from $K_4$ by subdividing one edge. ($K_4$ itself is not Ramsey size linear, since $R(4,n)\gg n^{3-o(1)}$, see [166].) Bradać, Gishboliner, and Sudakov [BGS23] have shown that every subdivision of $K_4$ on at least $6$ vertices is Ramsey size linear, and also that $R(H_5,H) \ll m$ whenever $H$ is a bipartite graph with $m$ edges and no isolated vertices.

OPEN
Let $G$ be a graph such that $R(G,T_n)\ll n$ for any tree $T_n$ on $n$ vertices and $R(G,K_n)\ll n^2$. Is it true that, for any $H$ with $m$ edges and no isolated vertices, $R(G,H)\ll m?$
In other words, is $G$ Ramsey size linear?
OPEN
Let $k\geq 1$. What is the best possible $c_k$ such that $R(C_{2k+1},H)\leq c_k m$ for any graph $H$ on $m$ edges without isolated vertices?
OPEN
Let $k\geq 3$. Is it true that, for any graph $H$ on $m$ edges without isolated vertices, $R(C_k,H) \leq 2m+\left\lceil\frac{k-1}{2}\right\rceil?$
This was proved for even $k$ by Erdős, Faudree, Rousseau, and Schelp [EFRS93]. It was proved for $k=3$ by Sidorenko [Si93].
OPEN
Show that for any rational $\alpha \in [1,2]$ there exists a bipartite graph $G$ such that $\mathrm{ex}(n;G)\asymp n^{\alpha}.$ Conversely, if $G$ is bipartite then must there exist some rational $\alpha$ such that$\mathrm{ex}(n;G)\asymp n^{\alpha}?$
A problem of Erdős and Simonovits. Bukh and Conlon [BuCo18] proved the first problem holds if we weaken asking for the extremal number of a single graph to asking for the extreaml number of a finite family of graphs.

A rational $\alpha\in [1,2]$ for which the first problem holds is known as a Turán exponent. Known Turán exponents are:

• $\frac{3}{2}-\frac{1}{2s}$ for $s\geq 2$ (Conlon, Janzer, and Lee [CJL21]).
• $\frac{4}{3}-\frac{1}{3s}$ and $\frac{5}{4}-\frac{1}{4s}$ for $s\geq 2$ (Jiang and Qiu [JiQi20]).
• $2-\frac{a}{b}$ for $\lfloor b/a\rfloor^3 \leq a\leq \frac{b}{\lfloor b/a\rfloor+1}+1$ (Jiang, Jiang, and Ma [JJM20]).
• $2-\frac{a}{b}$ with $b>a\geq 1$ and $b\equiv \pm 1\pmod{a}$ (Kang, Kim, and Liu [KKL21]).
• $1+a/b$ with $b>a^2$ (Jiang and Qiu [JiQi23]),
• $2-\frac{2}{2b+1}$ for $b\geq 2$ or $7/5$ (Jiang, Ma, and Yepremyan [JMY22]).
• $2-a/b$ with $b\geq (a-1)^2$ (Conlon and Janzer [CoJa22]).

OPEN
Show that for $k\geq 3$ $\mathrm{ex}(n;C_{2k})\gg n^{1+\frac{1}{k}}.$
It is easy to see that $\mathrm{ex}(n;C_{2k+1})=\lfloor n^2/4\rfloor$ for any $k\geq 1$ (and $n>2k+1$) (since no bipartite graph contains an odd cycle). Erdős and Klein [Er38] proved $\mathrm{ex}(n;C_4)\asymp n^{3/2}$.

Erdős [Er64c] and Bondy and Simonovits [BoSi74] showed that $\mathrm{ex}(n;C_{2k})\ll kn^{1+\frac{1}{k}}.$

Benson [Be66] has proved this conjecture for $k=3$ and $k=5$. Lazebnik, Ustimenko, and Woldar [LUW95] have shown that, for arbitrary $k\geq 3$, $\mathrm{ex}(n;C_{2k})\gg n^{1+\frac{2}{3k-3+\nu}},$ where $\nu=0$ if $k$ is odd and $\nu=1$ if $k$ is even. See [LUW99] for further history and references.

OPEN
Is it true that $\mathrm{ex}(n;\{C_3,C_4\})=(n/2)^{3/2}+O(n)?$
A problem of Erdős and Simonovits, who proved that $\mathrm{ex}(n;\{C_4,C_5\})=(n/2)^{3/2}+O(n).$

OPEN
Is it true that, for $k\geq 2$, $\mathrm{ex}(n;\{C_{2k-1},C_{2k}\})=(1+o(1))(n/2)^{1+\frac{1}{k}}.$
A problem of Erdős and Simonovits.

OPEN
If $\mathcal{F}$ is a finite set of finite graphs then $\mathrm{ex}(n;\mathcal{F})$ is the maximum number of edges a graph on $n$ vertices can have without containing any subgraphs from $\mathcal{F}$. Note that it is trivial that $\mathrm{ex}(n;\mathcal{F})\leq \mathrm{ex}(n;G)$ for every $G\in\mathcal{F}$.

Is it true that, for every $\mathcal{F}$, if there is a bipartite graph in $\mathcal{F}$ then there exists some bipartite $G\in\mathcal{F}$ such that $\mathrm{ex}(n;G)\ll_{\mathcal{F}}\mathrm{ex}(n;\mathcal{F})?$

A problem of Erdős and Simonovits.

OPEN
Let $Q_k$ be the $k$-dimensional hypercube graph (so that $Q_k$ has $2^k$ vertices and $k2^{k-1}$ edges). Determine the behaviour of $\mathrm{ex}(n;Q_k).$
Erdős and Simonovits [ErSi70] proved that $(\tfrac{1}{2}+o(1))n^{3/2}\leq \mathrm{ex}(n;Q_3) \ll n^{8/5}.$ In [Er81] Erdős asks whether it is $\asymp n^{8/5}$.

A theorem of Sudakov and Tomon [SuTo22] implies $\mathrm{ex}(n;Q_k)=o(n^{2-\frac{1}{k}}).$ Janzer and Sudakov [JaSu22b] have improved this to $\mathrm{ex}(n;Q_k)\ll_k n^{2-\frac{1}{k-1}+\frac{1}{(k-1)2^{k-1}}}.$ See also the entry in the graphs problem collection.

SOLVED
If $G$ is a graph with $4k$ vertices and minimum degree at least $2k$ then $G$ contains $k$ vertex-disjoint $4$-cycles.
A conjecture of Erdős and Faudree. Proved by Wang [Wa10].
SOLVED
If $G$ is a random graph on $2^d$ vertices, including each edge with probability $1/2$, then $G$ almost surely contains a copy of $Q_d$ (the $d$-dimensional hypercube with $2^d$ vertices and $d2^{d-1}$ many edges).
A conjecture of Erdős and Bollobás. Solved by Riordan [Ri00], who in fact proved this with any edge-probability $>1/4$, and proves that the number of copies of $Q_d$ is normally distributed.
OPEN
Let $\delta>0$. If $n$ is sufficiently large and $G$ is a graph on $n$ vertices with no $K_{2,2,2}$ and at least $\delta n^2$ edges then $G$ contains an independent set of size $\gg_\delta n$.
A problem of Erdős, Hajnal, Sós, and Szemerédi, who could prove this is true for $\delta>1/8$.

OPEN
Let $G$ be a graph on $n$ vertices such that at least $n/2$ vertices have degree at least $n/2$. Must $G$ contain every tree on at most $n/2$ vertices?
A conjecture of Erdős, Füredi, Loebl, and Sós. Ajtai, Komlós, and Szemerédi [AKS95] proved an asymptotic version, where at least $(1+\epsilon)n/2$ vertices have degree at least $(1+\epsilon)n/2$ (and $n$ is sufficiently large depending on $\epsilon$).

Komlós and Sós conjectured the generalisation that if at least $n/2$ vertices have degree at least $k$ then $G$ contains any tree with $k$ vertices.

SOLVED
Let $f(m)$ be the maximal $k$ such that a triangle-free graph on $m$ edges must contain a bipartite graph with $k$ edges. Determine $f(m)$.
Resolved by Alon [Al96], who showed that there exist constants $c_1,c_2>0$ such that $\frac{m}{2}+c_1m^{4/5}\leq f(m)\leq \frac{m}{2}+c_2m^{4/5}.$
SOLVED - $100 Does there exist a graph$G$with at most$10^{10}$many vertices which contains no$K_4$, and yet any$2$-colouring of the edges produces a monochromatic$K_3$? Erdős and Hajnal [ErHa67] first asked for the existence of any such graph. Existence was proved by Folkman [Fo70], but with very poor quantitative bounds. (As a result these quantities are often called Folkman numbers.) Let this particular Folkman number be denoted by$N$. Frankl and Rödl [FrRo86] proved$N\leq 7\times 10^{11}$, which Spencer [Sp88] improved to$\leq 3\times 10^{9}$. This resolved the initial challenge of Erdős [Er75d] to beat$10^{10}$. Lu [Lu07] proved$N\leq 9697$vertices. The current record is due to Dudek and Rödl [DuRo08] who proved$N\leq 941$vertices. For further information we refer to a paper of Radziszowski and Xu [RaXu07], who prove that$N\geq 19$and speculate that$N\leq 127$. OPEN Every connected graph on$n$vertices can be partitioned into at most$\lceil n/2\rceil$edge-disjoint paths. A problem of Erdős and Gallai. Lovász [Lo68] proved that every graph on$n$vertices can be partitioned into at most$\lfloor n/2\rfloor$edge-disjoint paths and cycles, which implies that every graph can be partitioned into at most$n-1$paths. Chung [Ch78] proved that every connected graph on$n$vertices can be partitioned into at most$\lceil n/2\rceil$edge-disjoint trees. Pyber [Py96] has shown that every connected graph on$n$vertices can be covered by at mst$n/2+O(n^{3/4})$paths. If we drop the edge-disjoint condition then this conjecture was proved by Fan [Fa02]. Hajos [Lo68] has conjectured that if$G$has all degrees even then$G$can be partitioned into at most$\lfloor n/2\rfloor$edge-disjoint cycles. See also [184] and the entry in the graphs problem collection. OPEN Let$G$be a graph with$n$vertices and$\delta n^{2}$edges. Are there subgraphs$H_1,H_2\subseteq G$such that •$H_1$has$\gg \delta^3n^2$edges and every two edges in$H_1$are contained in a cycle of length at most$6$, and furthermore if two edges share a vertex they are on a cycle of length$4$, and •$H_2$has$\gg \delta^2n^2$edges and every two edges in$H_2$are contained in a cycle of length at most$8$. A problem of Erdős, Duke, and Rödl. Duke and Erdős [DuEr83], who proved the first if$n$is sufficiently large depending on$\delta$. The real challenge is to prove this when$\delta=n^{-c}$for some$c>0$. Duke, Erdős, and Rödl [DER84] proved the first statement with a$\delta^5$in place of a$\delta^3$. Fox and Sudakov [FoSu08b] have proved the second statement when$\delta >n^{-1/5}$. OPEN What is the maximum number of edges that a graph on$n$vertices can have if it does not contain two edge-disjoint cycles with the same vertex set? Pyber, Rödl, and Szemerédi [PRS95] constructed such a graph with$\gg n\log\log n$edges. Chakraborti, Janzer, Methuku, and Montgomery [CJMM24] have shown that such a graph can have at most$n(\log n)^{O(1)}$many edges. Indeed, they prove that there exists a constant$C>0$such that for any$k\geq 2$there is a$c_k$such that if a graph has$n$vertices and at least$c_kn(\log n)^{C}$many edges then it contains$k$pairwise edge-disjoint cycles with the same vertex set. OPEN Let$G_1$and$G_2$be two graphs with chromatic number$\aleph_1$. Must there be a graph$H$with chromatic number$4$which appears as a subgraph of both$G_1$and$G_2$? Is there such an$H$with chromatic number$\aleph_0$? Erdős also asks about finding a common subgraph$H$(with chromatic number either$4$or$\aleph_0$) in any finite collection of graphs with chromatic number$\aleph_1$. Every graph with chromatic number$\aleph_1$contains all sufficiently large odd cycles (which have chromatic number$3$), see [594]. This was proved by Erdős, Hajnal, and Shelah [EHS74]. Erdős writes that 'probably' every graph with chromatic number$\aleph_1$contains as subgraphs all graphs with chromatic number$4$with sufficiently large girth. SOLVED Does every graph$G$with chromatic number$\geq \aleph_1$contain all sufficiently large odd cycles? A problem of Erdős and Hajnal. This was proved by Erdős, Hajnal, and Shelah [EHS74]. See also [593] and [737]. OPEN -$250
Is there an infinite graph $G$ which contains no $K_4$ and is not the union of countably many triangle-free graphs?
A problem of Erdős and Hajnal. Folkman [Fo70] and Nešetřil and Rödl [NeRo75] have proved that for every $n\geq 1$ there is a graph $G$ which contains no $K_4$ and is not the union of $n$ triangle-free graphs.

OPEN
For which graphs $G_1,G_2$ is it true that
• for every $n\geq 1$ there is a graph $H$ without a $G_1$ but if the edges of $H$ are $n$-coloured then there is a monochromatic copy of $G_2$, and yet
• for every graph $H$ without a $G_1$ there is an $\aleph_0$-colouring of the edges of $H$ without a monochromatic $G_2$.
Erdős and Hajnal originally conjectured that there are no such $G_1,G_2$, but in fact $G_1=C_4$ and $G_2=C_6$ is an example. Indeed, for this pair Nešetřil and Rödl established the first property and Erdős and Hajnal the second (in fact every $C_4$-free graph is a countable union of trees).

Whether this is true for $G_1=K_4$ and $G_2=K_3$ is the content of [595].

OPEN
Let $G$ be a graph on at most $\aleph_1$ vertices which contains no $K_4$ and no $K_{\aleph_0,\aleph_0}$ (the complete bipartite graph with $\aleph_0$ vertices in each class). Is it true that $\omega_1^2 \to (\omega_1\omega, G)^2?$ What about finite $G$?
Erdős and Hajnal proved that $\omega_1^2 \to (\omega_1\omega,3)^2$. Erdős originally asked this with just the assumption that $G$ is $K_4$-free, but Baumgartner proved that $\omega_1^2 \not\to (\omega_1\omega, K_{\aleph_0,\aleph_0})^2$.
SOLVED
Let $G$ be a (possibly infinite) graph and $A,B$ be disjoint independent sets of vertices. Must there exist a family $P$ of disjoint paths between $A$ and $B$ and a set $S$ which contains exactly one vertex from each path in $P$, and such that every path between $A$ and $B$ contains at least one vertex from $S$?
Sometimes known as the Erdős-Menger conjecture. When $G$ is finite this is equivalent to Menger's theorem. Erdős was interested in the case when $G$ is infinite.

This was proved by Aharoni and Berger [AhBe09].

OPEN
Let $e(n,r)$ be minimal such that every graph on $n$ vertices with at least $e(n,r)$ edges, each edge contained in at least one triangle, must have an edge contained in at least $r$ triangles. Let $r\geq 2$. Is it true that $e(n,r+1)-e(n,r)\to \infty$ as $n\to \infty$? Is it true that $\frac{e(n,r+1)}{e(n,r)}\to 1$ as $n\to \infty$?
Ruzsa and Szemerédi [RuSz78] proved that $e(n,r)=o(n^2)$ for any fixed $r$.

OPEN
For which limit ordinals $\alpha$ is it true that if $G$ is a graph with vertex set $\alpha$ then $G$ must have either an infinite path or independent set on a set of vertices with order type $\alpha$?
A problem of Erdős, Hajnal, and Milner [EHM70], who proved this is true for $\alpha < \omega_1^{\omega+2}$.

Larson [La90] proved this is true for all $\alpha<2^{\aleph_0}$ assuming Martin's axiom.

OPEN
Let $G$ be a graph with $n$ vertices and at least $\lfloor n^2/4\rfloor +1$ edges. Are there at least $2n^2/9$ edges of $G$ which are contained in a $C_5$?
Erdős [Er97d] stated that, under the same assumptions, there at least $2n^2/9$ edges of $G$ which are contained in some odd cycle. He wrote that a positive answer to this question would follow if we knew that $G$ must contain a triangle such that there at least $n/2-O(1)$ vertices joined to at least two vertices of the triangle.

Erdős and Faudree observed that every graph with $2n$ vertices and at least $n^2+1$ edges has a triangle whose vertices are joined to at least $n+2$ vertices.

SOLVED
Let $f(n)$ be minimal such that if the edges of $K_{2^n+1}$ are coloured with $n$ colours then there must be a monochromatic odd cycle of length at most $m$. Estimate $f(n)$. Does $f(n)\to \infty$ as $n\to \infty$?
A problem of Erdős and Graham. The edges of $K_{2^n}$ can be $n$-coloured to avoid odd cycles of any length. It can be shown that $C_5$ and $C_7$ can be avoided for large $n$.

Day and Johnson [DaJo17] have shown that $f(n)\geq 2^{c\sqrt{\log n}}$ for some constant $c>0$.

OPEN
For a graph $G$ let $\tau(G)$ denote the minimal number of vertices that include at least one from each maximal clique of $G$ (sometimes called the clique transversal number).

Estimate $\tau(G)$. In particular, is it true that if $G$ has $n$ vertices then $\tau(G) \leq n-c\sqrt{n\log n}$ for some absolute constant $c>0$?

A problem of Erdős, Gallai, and Tuza, who proved that $\tau(G) \leq n-\sqrt{2n}+O(1).$

This would be best possible, since there exist triangle-free graphs with all independent sets of size $O(\sqrt{n\log n})$, which follows from the lower bound for $R(3,k)$ by Kim [Ki95] (see [165]).

Indeed, Erdős, Gallai, and Tuza speculate that if $f(n)$ is the largest $k$ such that every triangle-free graph on $n$ vertices contains an independent set on $f(n)$ vertices, then $\tau(G)\leq n-f(n)$.

In [Er94] and [Er99] Erdős asks for a weaker upper bound $\tau(G) \leq n-\omega(n)\sqrt{n}$ for any $\omega(n)\to \infty$.

OPEN
For a graph $G$ let $\tau(G)$ denote the minimal number of vertices that include at least one from each maximal clique of $G$ (sometimes called the clique transversal number).

Is it true that if all maximal cliques in $G$ have at least $cn$ vertices then $\tau(G)=o_c(n)$?

Similarly, estimate for $c>0$ the minimal $k_c(n)$ such that if every maximal clique in $G$ has at least $k_c(n)$ vertices then $\tau(G)<(1-c)n$.

A problem of Erdős, Gallai, and Tuza [EGT92], who proved for the latter question that $k_c(n) \geq n^{c'/\log\log n}$ for some $c'>0$, and that if every clique has size least $k$ then $\tau(G) \leq n-(kn)^{1/2}$. Bollobás and Erdős proved that if every maximal clique has at least $n+3-2\sqrt{n}$ vertices then $\tau(G)=1$ (and this threshold is best possible).

OPEN
Let $G$ be a connected graph with $n$ vertices, minimal degree $d$, and diameter $D$. Show if that $G$ contains no $K_{2r}$ and $(r-1)(3r+2)\mid d$ then $D\leq \frac{2(r-1)(3r+2)}{(2r^2-1)d}n+O(1),$ and if $G$ contains no $K_{2r+1}$ and $3r-1 \mid d$ then $D\leq \frac{3r-1}{rd}n+O(1).$
A problem of Erdős, Pach, Pollack, and Tuza.
OPEN
Let $n\geq 3$ and $G$ be a graph with $\binom{2n+1}{2}-\binom{n}{2}-1$ edges. Must $G$ be the union of a bipartite graph and a graph with maximum degree less than $n$?
Faudree proved that this is true if $G$ has $2n+1$ vertices.
OPEN
Let $f(n,k)$ be minimal such that there is a graph with $n$ vertices and $f(n,k)$ edges where every set of $k+2$ vertices induces a subgraph with maximum degree at least $k$. Determine $f(n,k)$.
SOLVED
Does there exist some constant $c>0$ such that if $G$ is a graph with $n$ vertices and $\geq (1/8-c)n^2$ edges then $G$ must contain either a $K_4$ or an independent set on at least $n/\log n$ vertices?
A problem of Erdős, Hajnal, Simonovits, Sós, and Szemerédi [EHSSS93]. In other words, if $\mathrm{rt}(n;k,\ell)$ is the Ramsey-Turán number then is it true that $\mathrm{rt}(n; 4,n/\log n)< (1/8-c)n^2?$ Erdős, Hajnal, Sós, and Szemerédi [EHSS83] proved that for any fixed $\epsilon>0$ $\mathrm{rt}(n; 4,\epsilon n)< (1/8+o(1))n^2.$ Sudakov [Su03] proved that $\mathrm{rt}(n; 4,ne^{-f(n)})=o(n^2)$ whenever $f(n)/\sqrt{\log n}\to \infty$.

Resolved by Fox, Loh, and Zhao [FLZ15] who showed that the answer is no; in fact they prove that $\mathrm{rt}(n; 4, ne^{-f(n)})\geq (1/8-o(1))n^2$ whenever $f(n) =o(\sqrt{\log n/\log\log n})$.

OPEN
Let $r\geq 3$. For an $r$-uniform hypergraph $G$ let $\tau(G)$ denote the covering number (or transversal number), the minimum size of a set of vertices which includes at least one from each edge in $G$.

Determine the best possible $t$ such that, if $G$ is an $r$-uniform hypergraph $G$ where every subgraph $G'$ on at most $3r-3$ vertices has $\tau(G')\leq 1$, we have $\tau(G)\leq t$.

Erdős, Hajnal, and Tuza [EHT91] proved that this $t$ satisfies $\frac{3}{16}r+\frac{7}{8}\leq t \leq \frac{1}{5}r.$
OPEN
Let $r\geq 3$. If the edges of $K_{r^2+1}$ are $r$-coloured then there exist $r+1$ vertices with at least one colour missing on the edges of the induced $K_{r+1}$.
In other words, there is no balanced colouring. A conjecture of Erdős and Gyárfás [ErGy99], who proved it for $r=3$ and $r=4$ (and observered it is false for $r=2$), and showed this property fails for infinitely many $r$ if we replace $r^2+1$ by $r^2$.
SOLVED
For a triangle-free graph $G$ let $h_2(G)$ be the smallest number of edges that need to be added to $G$ so that it has diameter $2$ and is still triangle-free. Is it true that if $G$ has maximum degree $o(n^{1/2})$ then $h(G)=o(n^2)$?
A problem of Erdős, Gyárfás, and Ruszinkó [EGR98]. Simonovits showed that there exist graphs $G$ with maximum degree $\gg n^{1/2}$ and $h_2(G)\gg n^2$.

Erdős, Gyárfás, and Ruszinkó [EGR98] proved that if $G$ has no isolated vertices and maximum degree $O(1)$ then $h_2(G)\ll n\log n$.

Alon has observed this problem is essentially identical to [134], and his solution in this note also solves this problem in the affirmative.

OPEN
For a triangle-free graph $G$ let $h_r(G)$ be the smallest number of edges that need to be added to $G$ so that it has diameter $r$ (while preserving the property of being triangle-free).

Is it true that there exists a constant $c>0$ such that if $G$ is a connected graph on $n$ vertices then $h_4(G)<(1-c)n$?

A problem of Erdős, Gyárfás, and Ruszinkó [EGR98] who proved that $h_3(G)\leq n$ and $h_5(G) \leq \frac{n-1}{2}$ and there exist connected graphs $G$ on $n$ vertices with $h_3(G)\geq n-c$ for some constant $c>0$.

If we omit the condition that the graph must remain triangle-free then Alon, Gyárfás, and Ruszinkó [AGR00] have proved that adding $n/2$ edges always suffices to obtain diameter at most $4$.

OPEN
If $G$ is a graph on $n$ vertices without a $K_4$ then how large a triangle-free induced subgraph must $G$ contain?
This was first asked by Erdős and Rogers [ErRo62], and is generally known as the Erdős-Rogers problem. Let $f(n)$ be such that every such graph contains a triangle-free subgraph with at least $f(n)$ vertices.

It is now known that $f(n)=n^{1/2+o(1)}$. Bollobás and Hind [BoHi91] proved $n^{1/2} \ll f(n) \ll n^{7/10+o(1)}.$ Krivelevich [Kr94] improved this to $n^{1/2}(\log\log n)^{1/2} \ll f(n) \ll n^{2/3}(\log n)^{1/3}.$ Wolfovitz [Wo13] proved $f(n) \ll n^{1/2}(\log n)^{120}.$

OPEN
Let $G$ be a graph on $n$ vertices, $\alpha_1(G)$ be the maximum number of edges that contain at most one edge from every triangle, and $\tau_1(G)$ be the minimum number of edges that contain at least one edge from every triangle.

Is it true that $\alpha_1(G)+\tau_1(G) \leq \frac{n^2}{4}?$

A problem of Erdős, Gallai, and Tuza [EGT96], who observe that this is probably quite difficult since there are different examples where equality hold: the complete graph, the complete bipartite graph, and the graph obtained from $K_{m,m}$ by adding one vertex joined to every other.
OPEN
Let $G$ be a regular graph with $2n$ vertices and degree $n+1$. Must $G$ have $\gg 2^{2n}$ subsets that are on a cycle?
A problem of Erdős and Faudree. Erdős writes 'it is easy to see' that there are at least $(\frac{1}{2}+o(1))2^{2n}$ sets that are not on a cycle. If the regularity condition is replaced by minimum degree $n+1$ then the answer is no.
OPEN - $1000 The cochromatic number of$G$, denoted by$\zeta(G)$, is the minimum number of colours needed to colour the vertices of$G$such that each colour class induces either a complete graph or empty graph. Let$\chi(G)$denote the chromatic number. If$G$is a random graph with$n$vertices and each edge included independently with probability$1/2$then is it true that almost surely $\chi(G) - \zeta(G) \to \infty$ as$n\to \infty$? A problem of Erdős and Gimbel (see also [Gi16]). At a conference on random graphs in Poznan, Poland (most likely in 1989) Erdős offered \$100 for a proof that this is true, and \$1000 for a proof that this is false (although later told Gimbel that \$1000 was perhaps too much).

It is known that almost surely $\frac{n}{2\log_2n}\leq \zeta(G)\leq \chi(G)\leq (1+o(1))\frac{n}{2\log_2n}.$ (The final upper bound is due to Bollobás [Bo88]. The first inequality follows from the fact that almost surely $G$ has clique number and independence number $< 2\log_2n$.)

OPEN
Let $k\geq 4$ and $g_k(n)$ denote the largest $m$ such that there is a graph on $n$ vertices with chromatic number $k$ and girth $m$. Does $\lim_{n\to \infty}\frac{g_k(n)}{\log n}$ exist?
It is known that $\frac{1}{4\log k}\log n\leq g_k(n) \leq \frac{2}{\log(k-2)}\log n+1,$ the lower bound due to Kostochka [Ko88] and the upper bound to Erdős [Er59b].
OPEN
Let $\omega(G)$ denote the clique number of $G$ and $\chi(G)$ the chromatic number. If $f(n)$ is the maximum value of $\chi(G)/\omega(G)$, as $G$ ranges over all graphs on $n$ vertices, then does $\lim_{n\to\infty}\frac{f(n)}{n/(\log n)^2}$ exist?
Tutte and Zykov [Zy52] independently proved that for every $k$ there is a graph with $\omega(G)=2$ and $\chi(G)=k$. Erdős [Er61d] proved that for every $n$ there is a graph on $n$ vertices with $\omega(G)=2$ and $\chi(G)\gg n^{1/2}/\log n$, whence $f(n) \gg n^{1/2}/\log n$.

Erdős [Er67c] proved that $f(n) \asymp \frac{n}{(\log n)^2}$ and that the limit in question, if it exists, must be in $(\log 2)^2\cdot [1/4,1].$

OPEN
Let $G$ be a graph with chromatic number $k$ containing no $K_k$. If $a,b\geq 2$ and $a+b=k+1$ then must there exist two disjoint subgraphs of $G$ with chromatic numbers $\geq a$ and $\geq b$ respectively?
This property is sometimes called being $(a,b)$-splittable. A question of Erdős and Lovász (often called the Erdős-Lovász Tihany conjecture). Erdős [Er68b] originally asked about $a=b=3$ which was proved by Brown and Jung [BrJu69] (who in fact prove that $G$ must contain two vertex disjoint odd cycles).

Balogh, Kostochka, Prince, and Stiebitz [BKPS09] have proved the full conjecture for quasi-line graphs and graphs with independence number $2$.

OPEN
The list chromatic number $\chi_L(G)$ is defined to be the minimal $k$ such that for any assignment of a list of $k$ colours to each vertex of $G$ (perhaps different lists for different vertices) a colouring of each vertex by a colour on its list can be chosen such that adjacent vertices receive distinct colours.

Determine the minimal number of vertices $n(k)$ of a bipartite graph $G$ such that $\chi_L(G)>k$.

A problem of Erdős, Rubin, and Taylor [ERT80], who proved that $2^{k-1}<n(k) <k^22^{k+2}.$ They also prove that if $m(k)$ is the size of the smallest family of $k$-sets with property B (i.e. there is a set which intersects each member of the member yet does not contain any of them) then $m(k)\leq n(k)\leq m(k)$.

Erdős, Rubin, and Taylor [ERT80] proved $n(2)=6$ and Hanson, MacGillivray, and Toft [HMT96] proved $n(3)=14$ and $n(k) \leq kn(k-2)+2^k.$

SOLVED
The list chromatic number $\chi_L(G)$ is defined to be the minimal $k$ such that for any assignment of a list of $k$ colours to each vertex of $G$ (perhaps different lists for different vertices) a colouring of each vertex by a colour on its list can be chosen such that adjacent vertices receive distinct colours.

Does every planar bipartite graph $G$ have $\chi_L(G)\leq 3$?

A problem of Erdős, Rubin, and Taylor [ERT80]. The answer is yes, proved by Alon and Tarsi [AlTa92].

SOLVED
The list chromatic number $\chi_L(G)$ is defined to be the minimal $k$ such that for any assignment of a list of $k$ colours to each vertex of $G$ (perhaps different lists for different vertices) a colouring of each vertex by a colour on its list can be chosen such that adjacent vertices receive distinct colours.

Does every planar graph $G$ have $\chi_L(G)\leq 5$? Is this best possible?

A problem of Erdős, Rubin, and Taylor [ERT80]. The answer to both is yes: Thomassen [Th94] proved that $\chi_L(G)\leq 5$ if $G$ is planar, and Voigt [Vo93] constructed a planar graph with $\chi_L(G)=5$. A simpler construction was given by Gutner [Gu96].

SOLVED
A graph is $(a,b)$-choosable if for any assignment of a list of $a$ colours to each of its vertices there is a subset of $b$ colours from each list such that the subsets of adjacent vertices are disjoint.

If $G$ is $(a,b)$-choosable then $G$ is $(am,bm)$-choosable for every integer $m\geq 1$.

A problem of Erdős, Rubin, and Taylor [ERT80]. Note that $G$ is $(a,1)$-choosable corresponds to being $a$-choosable, that is, the list chromatic number satisfies $\chi_L(G)\leq a$.

This is false: Dvořák, Hu, and Sereni [DHS19] construct a graph which is $(4,1)$-choosable but not $(8,2)$-choosable.

Additional thanks to: David Penman and Raphael Steiner
SOLVED
Suppose $G$ is a graph on $n$ vertices which contains no complete graph or independent set on $\gg \log n$ many vertices. Must $G$ contain $\gg n^{5/2}$ induced subgraphs which pairwise differ in either the number of vertices or the number of edges?
A problem of Erdős, Faudree, and Sós, who proved there exist $\gg n^{3/2}$ many such subgraphs, and note that $n^{5/2}$ would be best possible.

This was proved by Kwan and Sudakov [KwSu21].

SOLVED
If $G$ is a graph on $n$ vertices which contains no complete graph or independent set on $\gg \log n$ vertices then $G$ contains an induced subgraph on $\gg n$ vertices which contains $\gg n^{1/2}$ distinct degrees.
A problem of Erdős, Faudree, and Sós.

This was proved by Bukh and Sudakov [BuSu07].

Jenssen, Keevash, Long, and Yepremyan [JKLY20] have proved that there must exist an induced subgraph which contains $\gg n^{2/3}$ distinct degrees (with no restriction on the number of vertices).

OPEN
Let $S$ be a family of finite graphs such that for every $n$ there is some $G_n\in S$ such that if the edges of $G_n$ are coloured with $n$ colours then there is a monochromatic triangle.

Is it true that for every infinite cardinal $\aleph$ there is a graph $G$ of which every finite subgraph is in $S$ and if the edges of $G$ are coloured with $\aleph$ many colours then there is a monochromatic triangle.

Erdős writes 'if the answer is affirmative many extensions and generalisations will be possible'.
OPEN
Is it true that if the edges of $K_n$ are 2-coloured then there are at most $n^2/4$ many edges which do not occur in a monochromatic triangle?
A problem of Erdős, Rousseau, and Schelp.
OPEN
Is there some function $f$ such that for all $k\geq 3$ if a finite graph $G$ has chromatic number $\geq f(k)$ then $G$ must contain some odd cycle whose vertices span a graph of chromatic number $\geq k$?
A problem of Erdős and Hajnal.
OPEN
Is there some function $f$ such that for all $k\geq 1$ if a finite graph $G$ has chromatic number $\geq f(k)$ then $G$ has $k$ edge disjoint cycles on the same set of vertices?
A problem of Erdős and Hajnal.
OPEN
Is there some constant $C$ such that any graph $G$ on $n$ vertices with $\geq Cn$ edges must contain a cycle which has at least as many diagonals as vertices?
A problem of Hamburger and Szegedy.
OPEN
Let $f(n;t)$ be minimal such that if a $t$-uniform hypergraph on $n$ vertices contains at least $f(n;t)$ edges then there must be four edges $A,B,C,D$ such that $A\cup B= C\cup D$ and $A\cap B=C\cap D=\emptyset.$ Estimate $f(n;t)$ - in particular, is it true that for $t\geq 3$ $f(n;t)=(1+o(1))\binom{n}{t-1}?$
For $n=2$ this is asking for the maximal number of edges on a graph which contains no $C_4$, and so $f(n;2)=(1+o(1))n^{3/2}$.

Füredi proved that $f(n;3) \ll n^2$ and $f(n;3) > \binom{n}{2}$ for infinitely many $n$. More generally, Füredi proved that $f(n;t) \ll \binom{n}{t-1}.$

SOLVED
Let $Q_n$ be the $n$-dimensional hypercube graph (so that $Q_n$ has $2^n$ vertices and $n2^{n-1}$ edges). Is it true that, for every $\epsilon>0$, if $n$ is sufficiently large, every subgraph of $Q_n$ with $\geq \epsilon n2^{n-1}$ many edges contains a $C_6$?
In [Er91] Erdős further suggests that perhaps, for every $k\geq 3$, there are constants $c$ and $a_k<1$ such that every subgraph with at least $cn^{a_k}2^n$ many edges contains a $C_{2k}$, where $a_k\to 0$ as $k\to \infty$.

The answer to this problem is no: Chung [Ch92] and Brouwer, Dejter, and Thomassen [BDT93] constructed an edge-partition of $Q_n$ into four subgraphs, each containing no $C_6$.

OPEN
Let $p,q\geq 1$ be fixed integers. We define $H(n)=H(N;p,q)$ to be the largest $m$ such that any graph on $n$ vertices where every set of $p$ vertices spans at least $q$ edges must contain a complete graph on $m$ vertices. Is $c(p,q)=\liminf \frac{\log H(n)}{\log n}$ a strictly increasing function of $q$ for $1\leq q\leq \binom{p-1}{2}+1$?
A problem of Erdős, Faudree, Rousseau, and Schelp.

When $q=1$ this corresponds exactly to the classical Ramsey problem, and hence for example $\frac{1}{p-1}\leq c(p,1) \leq \frac{2}{p+1}.$ It is easy to see that if $q=\binom{p-1}{2}+1$ then $c(p,q)=1$. Erdős, Faudree, Rousseau, and Schelp have shown that $c(p,\binom{p-1}{2})\leq 1/2$.

OPEN
Let $G_n$ be the unit distance graph in $\mathbb{R}^n$, with two vertices joined by an edge if and only if the distance between them is $1$.

Estimate the chromatic number $\chi(G_n)$. Does it grow exponentially in $n$? Does $\lim_{n\to \infty}\chi(G_n)^{1/n}$ exist?

A generalisation of the Hadwiger-Nelson problem (which addresses $n=2$). Frankl and Wilson [FrWi81] proved exponential growth: $\chi(G_n) \geq (1+o(1))1.2^n.$ The trivial colouring (by tiling with cubes) gives $\chi(G_n) \leq (2+\sqrt{n})^n.$ Larman and Rogers [LaRo72] improved this to $\chi(G_n) \leq (3+o(1))^n,$ and conjecture the truth may be $(2^{3/2}+o(1))^n$. Prosanov [Pr20] has given an alternative proof of this upper bound.

OPEN
Let $G$ be a finite unit distance graph in $\mathbb{R}^2$ (i.e. the vertices are a finite collection of points in $\mathbb{R}^2$ and there is an edge between two points f and only if the distance between them is $1$).

Is there some $k$ such that if $G$ has girth $\geq k$ (i.e. $G$ contains no cycles of length $<k$) then $\chi(G)\leq 3$?

The maximal value of $\chi(G)$ (without a girth condition) is the Hadwiger-Nelson problem. There are unit distance graphs (e.g. the Moser spindle) with $\chi(G)=4$ of girth $3$. de Grey [dG18] has constructed a unit distance graph $G$ with $\chi(G)=5$. (I do not know what the largest girth achieved is by these recent constructions.)

Wormald [Wo79] has constructed a unit distance graph with $\chi(G)=4$ and girth $5$, with $6448$ vertices. O'Donnell [OD94] has constructed a unit distance graph with $\chi(G)=4$ and girth $4$, with $56$ vertices. Chilakamarri [Ch95] has constructed an infinite family of unit distance graphs with $\chi(G)=4$ and girth $4$, the smallest of which has $47$ vertices.

OPEN
Let $L(r)$ be such that if $G$ is a graph formed by taking a finite set of points $P$ in $\mathbb{R}^2$ and some set $A\subset (0,\infty)$ of size $r$, where the vertex set is $P$ and there is an edge between two points if and only if their distance is a member of $A$, then $\chi(G)\leq L(r)$.

Estimate $L(r)$. In particular, is it true that $L(r)\leq r^{O(1)}$?

The case $r=1$ is the Hadwiger-Nelson problem, for which it is known that $5\leq L(1)\leq 7$.

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 $3$ $3$-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$.

OPEN
Is it true that $\mathrm{ex}(n; K_{r,r}) \gg n^{2-1/r}?$
Kövári, Sós, and Turán [KST54] proved $\mathrm{ex}(n; K_{r,r}) \ll n^{2-1/r}.$ Brown [Br66] proved the conjectured lower bound when $r=3$.

OPEN
Does every regular graph of degree $4$ contain a regular subgraph of degree $3$? Is there any $r$ such that every regular graph of degree $r$ must contain a regular subgraph of degree $3$?
A problem of Berge (or Berge and Sauer). Alon, Friedland, and Kalai [AFK84] proved that every $4$-regular graph plus an edge contains a $3$-regular subgraph, and hence in particular every $r$-regular graph with $r\geq 5$ contains a $3$-regular subgraph.
SOLVED
Let $G$ be a $3$-uniform hypergraph with $6$ vertices and $3$ $3$-edges. Is it true that $\mathrm{ex}_3(n,G)=o(n^2)?$
A conjecture of Brown, Erdős, and Sós. The answer is yes, proved by Ruzsa and Szemerédi [RuSz78] (this is known as the Ruzsa-Szemerédi problem).

In [Er81] Erdős asks whether the same is true for any $3$-uniform hypergraph on $k$ vertices with $k-3$ $3$-edges.

SOLVED
Let $G$ be a graph on $n$ vertices with chromatic number $\chi(G)$ and let $\sigma(G)$ be the maximal $k$ such that $G$ contains a subdivision of $K_k$. Is it true that $\chi(G) \ll \frac{n^{1/2}}{\log n}\sigma(G)?$
Hajós originally conjectured that $\chi(G)\leq \sigma(G)$, which was proved by Dirac [Di52] when $\chi(G)=4$. Catlin [Ca74] disproved Hajós' conjecture for all $\chi(G)\geq 7$, and Erdős and Fajtlowicz [ErFa81] disproved it in a strong form, showing that in fact for almost all graphs on $n$ vertices, $\chi(G) \gg \frac{n^{1/2}}{\log n}\sigma(G).$

The answer is yes, proved by Fox, Lee, and Sudakov [FLS13].

SOLVED
Is there some constant $C>0$ such that any graph on $n$ vertices with $\geq Cr^2n$ edges contains a subdivision of $K_r$?
A conjecture of Erdős, Hajnal, and Mader. Dirac [Di60] proved that every graph on $n$ vertices with at least $2n-2$ edges contains a subdivision of $K_4$, and conjectured that $3n-5$ edges forces a subdivision of $K_5$.

Mader [Ma67] proved that $\geq 2^{\binom{r}{2}}n$ edges suffices.

The answer is yes, proved independently by Komlós and Szemerédi [KoSz96] and Bollobás and Thomason [BoTh96].

OPEN
Let $\mathrm{ex}_r(n;K_{r+1}^r)$ be the maximum number of $r$-edges that can be placed on $n$ vertices without forming a $K_{r+1}^r$ (the $r$-uniform complete graph on $r+1$ vertices).

Is every $r$-hypergraph $G$ on $n$ vertices the union of at most $\mathrm{ex}_{r}(n;K_{r+1}^r)$ many copies of $K_r^r$ and $K_{r+1}^r$, no two of which share a $K_r^r$?

A conjecture of Erdős and Sauer.
SOLVED - $100 Let$\hat{R}(G)$denote the size Ramsey number, the minimal number of edges$m$such that there is a graph$H$with$m$edges such that in any$2$-colouring of the edges of$H$there is a monochromatic copy of$G$. Is it true that, if$P_n$is the path of length$n$, then $\hat{R}(P_n)/n\to \infty$ and $\hat{R}(P_n)/n^2 \to 0?$ A problem of Erdős, Faudree, Rousseau, and Schelp. Answered by Beck [Be83b], who proved that in fact$\hat{R}(P_n)\ll n$. OPEN Let$G$be a graph with chromatic number$\aleph_1$. Is there, for any integer$m\geq 1$, some graph$G_m$of chromatic number$m$such that every finite subgraph of$G_m$is a subgraph of$G$? A conjecture of Walter Taylor. More generally, Erdős asks to characterise families$\mathcal{F}_\alpha$of finite graphs such that there is a graph of chromatic number$\aleph_\alpha$all of whose finite subgraphs are in$\mathcal{F}_\alpha$. OPEN Let$G$be a graph with chromatic number$\aleph_1$. Must there exist an edge$e$such that, for all large$n$,$G$contains a cycle of length$n$containing$e$? A problem of Erdős, Hajnal, and Shelah [EHS74], who proved that$G$must contain all sufficiently large cycles (see [594]). OPEN If$G$has infinite chromatic number and is triangle-free (contains no$K_3$) then must$G$contain every tree as an induced subgraph? A conjecture of Gyárfás. OPEN Let$\mathfrak{m}$be an infinite cardinal and$G$be a graph with chromatic number$\mathfrak{m}$. Is it true that, for every infinite cardinal$\mathfrak{n}< \mathfrak{m}$, there exists a subgraph of$G$with chromatic number$\mathfrak{n}$? A question of Galvin, who proved that the answer is no if we ask for the subgraph to be induced (assuming$\aleph_1 < 2^{\aleph_0}$). OPEN Let$\mathfrak{m}$be an infinite cardinal and$G$be a graph with chromatic number$\mathfrak{m}$. Let$C\geq 1$. Must$G$contain a subgraph of chromatic number$\mathfrak{m}$which does not contain any odd cycle of length$\leq C$? A question of Erdős and Hajnal. Rödl proved this is true if$\mathfrak{m}=\aleph_0$and$C=3$. In [Er81] Erdős also asks the same question but with girth (i.e. the subgraph does not contain any cycle at all of length$\leq C$). SOLVED Let$G$be a graph on$n$vertices with diameter$2$, such that deleting any edge increases the diameter of$G$. Is it true that$G$has at most$n^2/4$edges? A conjecture of Murty and Plesnik (see [CaHa79]) (although Füredi credits this conjecture to Murty and Simon, and further mentions that Erdős told him that the conjecture goes back to Ore in the 1960s). The complete bipartite graph shows that this would be best possible. This is true (for sufficiently large$n$) and was proved by Füredi [Fu92]. Additional thanks to: Noga Alon OPEN Let$T_2,\ldots,T_n$be a collection of trees such that$T_k$has$k$vertices. Can we always write$K_n$as the edge disjoint union of the$T_k$? A conjecture of Gyárfás, known as the tree packing conjecture. Gyárfás and Lehel [GyLe78] proved that this holds if all but at most$2$of the trees are stars, or if all the trees are stars or paths. Fishburn [Fi83] proved this for$n\leq 9$. Bollobás [Bo83] proved that the smallest$\lfloor n/\sqrt{2}\rfloor$many trees can always be packed greedily into$K_n$. Joos, Kim, Kühn, and Osthus [JKKO19] proved that this conjecture holds when the trees have bounded maximum degree. Allen, Böttcher, Clemens, Hladky, Piguet, and Taraz [ABCHPT21] proved that this conjecture holds when all the trees have maximum degree$\leq c\frac{n}{\log n}$for some constant$c>0$. Janzer and Montgomery [JaMo24] have proved that there exists some$c>0$such that the largest$cn$trees can be packed into$K_n$. Additional thanks to: Zach Hunter SOLVED Let$k$be a large fixed constant. Let$f_k(n)$be the minimal$m$such that there exists a graph$G$on$n$vertices with chromatic number$k$, such that every proper subgraph has chromatic number$<k$, and$G$can be made bipartite by deleting$m$edges. Is it true that$f_k(n)\to \infty$as$n\to \infty$? In particular, is it true that$f_4(n) \gg \log n$? A problem of Erdős, Hajnal, and Szemerédi [EHS82]. Odd cycles show that$f_3(n)=1$, but they expected$f_4(n)\to \infty$. Gallai [Ga68] gave a construction which shows $f_4(n) \ll n^{1/2},$ and Lovász extended this to show $f_k(n) \ll n^{1-\frac{1}{k-2}}.$ This conjecture was disproved by Rödl and Tuza [RoTu85], who proved that in fact$f_k(n)=\binom{k-1}{2}$(for all sufficiently large$n$). Additional thanks to: Raphael Steiner SOLVED Describe the size of the second largest component of the random graph on$n$vertices, where each edge is included independently with probability$1/n$. Erdős believed that almost surely the second largest component has size$\ll \log n$. This is true, as proved by Komlós, Sulyok, and Szemerédi [KSS80]. SOLVED Is it true that, almost surely, a random graph on$n$vertices with$\geq (\tfrac{1}{2}+\epsilon)n\log n$edges is Hamiltonian? A conjecture of Erdős and Rényi [ErRe66], who proved that almost surely such a graph has a perfect matching (when$n$is even). This is true. Pósa [Po76] proved that almost surely a random graph with$\geq Cn\log n$edges is Hamiltonian for some large constant$C$, and Komlós and Szemerédi [KoSz83] proved that $\geq \frac{1}{2}n\log n+\frac{1}{2}n\log\log n+w(n)n$ edges suffices, for any function$w$which$\to \infty$as$n\to \infty$. OPEN Let$f(m)$be some function such that$f(m)\to \infty$as$m\to \infty$. Does there exist a graph$G$of infinite chromatic number such that every subgraph on$m$vertices contains an independent set of size at least$\frac{m}{2}-f(m)$? Erdős and Hajnal proved this is true if$f(m)=\epsilon m$for any fixed$\epsilon>0$. See also [75]. SOLVED Let$G$be a graph with chromatic number$\chi(G)=4$. If$m_1<m_2<\cdots$are the lengths of the cycles in$G$then can$\min(m_{i+1}-m_i)$be arbitrarily large? Can this happen if the girth of$G$is large? The answer is no: Bondy and Vince [BoVi98] proved that every graph with minimum degree at least$3$has two cycles whose lengths differ by at most$2$, and hence the same is true for every graph with chromatic number$4$. Additional thanks to: Raphael Steiner OPEN Let$G$be a graph with minimum degree$k$and girth$>2s$(i.e.$G$contains no cycles of length$\leq 2s$). Must there be$\gg k^s$many distinct cycle lengths in$G$? A question of Erdős, Faudree, and Schelp, who proved it when$s=2$. SOLVED The list chromatic number$\chi_L(G)$is defined to be the minimal$k$such that for any assignment of a list of$k$colours to each vertex of$G$(perhaps different lists for different vertices) a colouring of each vertex by a colour on its list can be chosen such that adjacent vertices receive distinct colours. Does there exist some constant$c>0$such that $\chi_L(G)+\chi_L(G^c)> n^{1/2+c}$ for every graph$G$on$n$vertices (where$G^c$is the complement of$G$)? A problem of Erdős, Rubin, and Taylor. The answer is no: Alon [Al92] proved that, for every$n$, there exists a graph$G$on$n$vertices such that $\chi_L(G)+\chi_L(G^c)\ll (n\log n)^{1/2},$ where the implied constant is absolute. SOLVED The cochromatic number of$G$, denoted by$\zeta(G)$, is the minimum number of colours needed to colour the vertices of$G$such that each colour class induces either a complete graph or empty graph. Let$z(n)$be the maximum value of$\zeta(G)$over all graphs$G$with$n$vertices. Determine$z(n)$for small values of$z(n)$. In particular is it true that$z(12)=4$? A question of Erdős and Gimbel, who knew that$4\leq z(12)\leq 5$and$5\leq z(15)\leq 6$. The equality$z(12)=4$would follow from proving that if$G$is a graph on$12$vertices such that both$G$and its complement are$K_4$-free then either$\chi(G)\leq 4$or$\chi(G^c)\leq 4$. In fact there do exist such graphs - Bhavik Mehta found computationally that there is exactly one (up to taking the complement) graph on$12$vertices such that both$G$and its complement are$K_4$-free with chromatic number$\geq 5$. This graph was explicitly checked to have cochromatic number$4$, and hence this proves that indeed$z(12)=4$. The values of$z(n)$are now known for$1\leq n\leq 19$: $1,1,2,2,3,3,3,3,4,4,4,4,5,5,5,6,6,6,6.$ (The only significant difficulty here is proving$z(12)=4$- the others follow from easy inductive arguments and the facts that$R(3)=6$and$R(4)=18$.) It is unknown whether$z(20)=6$or$7$. Gimbel [Gi86] has shown that$z(n) \asymp \frac{n}{\log n}$. Additional thanks to: Bhavik Mehta OPEN The cochromatic number of$G$, denoted by$\zeta(G)$, is the minimum number of colours needed to colour the vertices of$G$such that each colour class induces either a complete graph or empty graph. Let$z(S_n)$be the maximum value of$\zeta(G)$over all graphs$G$which can be embedded on$S_n$, the orientable surface of genus$n$. Determine the growth rate of$z(S_n)$. A problem of Erdős and Gimbel. Gimbel [Gi86] proved that $\frac{\sqrt{n}}{\log n}\ll z(S_n) \ll \sqrt{n}.$ SOLVED The cochromatic number of$G$, denoted by$\zeta(G)$, is the minimum number of colours needed to colour the vertices of$G$such that each colour class induces either a complete graph or empty graph. If$G$is a graph with chromatic number$\chi(G)=m$then must$G$contain a subgraph$H$with $\zeta(H) \gg \frac{m}{\log m}?$ A problem of Erdős and Gimbel, who proved that there must exist a subgraph$H$with $\zeta(H) \gg \left(\frac{m}{\log m}\right)^{1/2}.$ The proposed bound would be best possible, as shown by taking$G$to be a complete graph. The answer is yes, proved by Alon, Krivelevich, and Sudakov [AKS97]. OPEN The cochromatic number of$G$, denoted by$\zeta(G)$, is the minimum number of colours needed to colour the vertices of$G$such that each colour class induces either a complete graph or empty graph. The dichromatic number of$G$, denoted by$\delta(G)$, is the minimum number$k$of colours required such that, in any orientation of the edges of$G$, there is a$k$-colouring of the vertices of$G$such that there are no monochromatic oriented cycles. Must a graph with large chromatic number have large dichromatic number? Must a graph with large cochromatic number contain a graph with large dichromatic number? The first question is due to Erdős and Neumann-Lara. The second question is due to Erdős and Gimbel. A positive answer to the second question implies a positive answer to the first via the bound mentioned in [760]. SOLVED The cochromatic number of$G$, denoted by$\zeta(G)$, is the minimum number of colours needed to colour the vertices of$G$such that each colour class induces either a complete graph or empty graph. Is it true that if$G$has no$K_5$and$\zeta(G)\geq 4$then$\chi(G) \leq \zeta(G)+2$? A conjecture of Erdős, Gimbel, and Straight [EGS90], who proved that for every$n>2$there exists some$f(n)$such that if$G$contains no clique on$n$vertices then$\chi(G)\leq \zeta(G)+f(n)$. This has been disproved by Steiner [St24b], who constructed a graph$G$with$\omega(G)=4$,$\zeta(G)=4$, and$\chi(G)=7$. SOLVED Give an asymptotic formula for$\mathrm{ex}(n;C_4)$. Erdős and Klein [Er38] proved$\mathrm{ex}(n;C_4)\asymp n^{3/2}$. Reiman [Re] proved $\frac{1}{2\sqrt{2}}\leq \lim \frac{\mathrm{ex}(n;C_4)}{n^{3/2}}\leq \frac{1}{2}.$ Erdős and Rényi, and independently Brown, gave a construction that proved if$n=q^2+q+1$, where$q$is a prime power, then $\mathrm{ex}(n;C_4)\geq\frac{1}{2}q(q+1)^2.$ Coupled with the upper bound of Reiman this implies that$\mathrm{ex}(n;C_4)\sim\frac{1}{2}n^{3/2}$for all large$n$. Füredi [Fu83] proved that if$q>13$then $\mathrm{ex}(n;C_4)=\frac{1}{2}q(q+1)^2.$ See also [572]. Additional thanks to: Rishika Agrawal OPEN Let$f(n;k,l)=\min \mathrm{ex}(n;G)$, where$G$ranges over all graphs with$k$vertices and$l$edges. Give good estimates for$f(n;k,l)$in the range$k<l\leq k^2/4$. For fixed$k$and large$n$is$f(n;k,l)$a strictly monotone function of$l$? Dirac and Erdős proved independently that when$l=\lfloor k^2/4\rfloor+1$$f(n;k,l)\leq \lfloor n^2/4\rfloor+1.$ SOLVED Let$g_k(n)$be the maximal number of edges possible on a graph with$n$vertices which does not contain a cycle with$k$chords incident to a vertex on the cycle. Is it true that $g_k(n)=(k+1)n-(k+1)^2$ for$n$sufficiently large? Czipszer proved that$g_k(n)$exists for all$k$, and in fact$g_k(n)\leq (k+1)n$. Erdős wrote it is 'easy to see' that $g_k(n)\geq (k+1)n-(k+1)^2.$ Pósa proved that$g_1(n)=2n-4$for$n\geq 4$. Erdős could prove the conjectured equality for$n\geq 2k+2$when$k=2$or$k=3$. The conjectured equality was proved for$n\geq 3k+3$by Jiang [Ji04]. Additional thanks to: Raphael Steiner OPEN Is there a$3$-uniform hypergraph on$n$vertices which contains at least$n-O(1)$different sizes of cliques (maximal complete subgraphs) Erdős constructed such a hypergraph with cliques of at least$n-\log_*n$different sizes. For graphs, Spencer [Sp71] constructed a graph which contains cliques of at least$n-\log_2n+O(1)$different sizes, which Moon and Moser [MoMo65] showed to be best possible. SOLVED If$\mathcal{F}$is a family of subsets of$\{1,\ldots,n\}$then we write$G_{\mathcal{F}}$for the graph on$\mathcal{F}$where$A\sim B$if$A$and$B$are comparable - that is,$A\subseteq B$or vice versa. Is it true that, if$\epsilon>0$and$n$is sufficiently large, whenever$m\leq (2-\epsilon)2^{n/2}$the graph$G_\mathcal{F}$has$<2^{n}$many edges? Is it true that if$G_{\mathcal{F}}$has$\geq cm^2$edges then$m\ll_c 2^{n/2}$? Is it true that, for any$\epsilon>0$, there exists some$\delta>0$such that if there are$>m^{2-\delta}$edges then$m<(2+\epsilon)^{n/2}$? A problem of Daykin and Erdős. Daykin and Frankl proved that if there are$(1+o(1))\binom{m}{2}$edges then$m^{1/n}\to 1$as$n\to \infty$. For the first question we need to take$\epsilon>0$since since if$n$is even and$m=2^{n/2+1}$one could take$\mathcal{F}$to be all subsets of$\{1,\ldots,n/2\}$together with$\{1,\ldots,n/2\}$union all subsets of$\{n/2+1,\ldots,n\}$, which produces$2^{n}$edges. The third question was answered in the affirmative by Alon and Frankl [AlFr85], who proved that, for every$k\geq 1$, if$m=2^{(\frac{1}{k+1}+\delta)n}$for some$\delta>0$then the number of edges is $< \left(1-\frac{1}{k}\right)\binom{m}{2}+O(m^{2-\Omega_k(\delta^{k+1})}).$ They also answer the second question in the negative, noting that if$\mathcal{F}$is the family of sets which either intersect$\{n/2+1,\ldots,n\}$in at most$1$element or intersect$\{1,\ldots,n/2\}$in at least$n/2-1$elements then$m \gg n2^{n/2}$and there are at least$2^{-5}\binom{m}{2}$edges. Finally, an affirmative answer to the first question follows from Theorem 1.4 and Corollary 1.5 of Alon, Das, Glebov, and Sudakov [ADGS15]. OPEN Alice and Bob play a game on the edges of$K_n$, alternating colouring edges by red (Alice) and blue (Bob). Alice wins if at the end the largest red clique is larger than any of the blue cliques. Does Bob have a winning strategy for$n>2$? If we change the game so that Bob colours two edges after each edge that Alice colours, but now require Bob's largest clique to be strictly larger than Alice's, then does Bob have a winning strategy for$n>3$? Finally, consider the game when Alice wins if the maximum degree of the red subgraph is larger than the maximum degree of the blue subgraph. Who wins? OPEN Is it true that every$3$-uniform hypergraph on$3n$vertices with at least$n^3+1$edges must contain either a subgraph on$4$vertices with$3$edges or a subgraph on$5$vertices with$7$edges? Additional thanks to: Rishika Agrawal SOLVED Let$f(d)$be the maximal acyclic chromatic number of any graph with maximum degree$d$- that is, the vertices of any graph with maximum degree$d$can be coloured with$f(d)$colours such that there is no edge between vertices of the same colour and no cycle containing only two colours. Estimate$f(d)$. In particular is it true that$f(d)=o(d^2)$? It is easy to see that$f(d)\leq d^2+1$using a greedy colouring. Erdős had shown$f(d)\geq d^{4/3-o(1)}$. Resolved by Alon, McDiarmid, and Reed [AMR91] who showed $\frac{d^{4/3}}{(\log d)^{1/3}}\ll f(d) \ll d^{4/3}.$ Additional thanks to: Noga Alon SOLVED The list chromatic number$\chi_L(G)$is defined to be the minimal$k$such that for any assignment of a list of$k$colours to each vertex of$G$(perhaps different lists for different vertices) a colouring of each vertex by a colour on its list can be chosen such that adjacent vertices receive distinct colours. Is it true that$\chi_L(G)=o(n)$for almost all graphs on$n$vertices? A problem of Erdős, Rubin and Taylor. The answer is yes: Alon [Al92] proved that in fact the random graph on$n$vertices with edge probability$1/2$has $\chi_L(G) \ll \frac{\log\log n}{\log n}n$ almost surely. Alon, Krivelevich, and Sudakov [AKS99] improved this to $\chi_L(G) \asymp \frac{n}{\log n}$ almost surely. Additional thanks to: David Penman SOLVED If$G$is a graph on$n$vertices which has no two adjacent vertices of degree$\geq 3$then $R(G)\ll n,$ where the implied constant is absolute. A problem of Burr and Erdős. Solved by Alon [Al94]. This is a special case of [163]. SOLVED If$G$is a graph on$n$vertices containing no independent set on$>n^{1/2}$vertices then there is a set of$\leq n^{1/2}$vertices containing$\gg n^{1/2}\log n$edges. Proved by Alon [Al96b]. OPEN Is it true that any graph$K_r$-free graph on$n$vertices with average degree$t$contains an independent set on $\gg_r \frac{\log t}{t}n$ many vertices? A conjecture of Ajtai, Erdős, Komlós, and Szemerédi [AEKS81], who proved that there must exist an independent set on $\gg_r \frac{\log\log(t+1)}{t}n$ many vertices. Shearer [Sh95] improved this to $\gg_r \frac{\log t}{\log\log(t+1)t}n.$ Ajtai, Komlós, and Szemerédi [AKS80] proved the conjectured bound when$r=3$. Alon [Al96b] proved the conjectured bound, but replacing the$K_r$-free assumption with the stronger assumption that the induced graph on every vertex neighbourhood has chromatic number$\leq r-2$. SOLVED We call a graph$HD$-balanced if the maximum degree of$H$is at most$D$times the minimum degree of$H$. Is it true that for every$m\geq 1$, if$n$is sufficiently large, any graph on$n$vertices with$\geq n\log_2n$edges contains a$O(1)$-balanced subgraph with$m$vertices and$\gg m\log m$edges (where the implied constants are absolute)? A problem of Erdős and Simonovits [ErSi70], who proved a similar claim replacing$\log n$and$\log m$by$n^{c}$and$m^c$respectively, for any constant$c>0$(where the balance parameter may depend on$c$). Alon [Al08] proved this is actually false: for every$D>1$and$n>10^5$there is a graph$G$with$\leq 2n$vertices and$\geq 2n\log(2n)$edges such that if$H$is a$D$-balanced subgraph then$H$has$\ll m(\sqrt{\log m}+\log D)$many edges. SOLVED Let$f(m,n)$be maximal such that any graph on$n$vertices in which every induced subgraph on$m$vertices has an independent set of size at least$\log n$must contain an independent set of size at least$f(n)$. Estimate$f(n)$. In particular, is it true that$f((\log n)^2,n) \geq n^{1/2-o(1)}$? Is it true that$f((\log n)^3,n)\gg (\log n)^3$? A question of Erdős and Hajnal. Alon and Sudakov [AlSu07] proved that in fact $\frac{(\log n)^2}{\log\log n}\ll f((\log n)^2,n) \ll (\log n)^2$ and $f((\log n)^3,n)\asymp \frac{(\log n)^2}{\log\log n}.$ See also [805]. Additional thanks to: Noga Alon OPEN For which functions$g(n)$with$n>g(n)\geq (\log n)^2$is there a graph on$n$vertices in which every induced subgraph on$g(n)$vertices contains a clique of size$\geq \log n$and an independent set of size$\geq \log n$? In particular, is there such a graph for$g(n)=(\log n)^3$? A problem of Erdős and Hajnal, who thought that there is no such graph for$g(n)=(\log n)^3$. Alon and Sudakov [AlSu07] proved that there is no such graph with $g(n)=\frac{c}{\log\log n}(\log n)^3$ for some constant$c>0$. Alon, Bucić, and Sudakov [ABS21] construct such a graph with $g(n)\leq 2^{2^{(\log\log n)^{1/2+o(1)}}}.$ See also [804]. Additional thanks to: Zach Hunter SOLVED The bipartition number$\tau(G)$of a graph$G$is the smallest number of pairwise edge disjoint complete bipartite graphs whose union is$G$. The independence number$\alpha(G)$is the size of the largest independent subset of$G$. Is it true that, if$G$is a random graph on$n$vertices with edge probability$1/2$, then $\tau(G)=n-\alpha(G)$ almost surely? Alon [Al15] showed this is false: in fact almost surely$\tau(G) \leq n-\alpha(G)-1$. Alon, Bohman, and Huang [ABH17] proved that in fact there is some absolute constant$c>0$such that almost surely $\tau(G) \leq n-(1+c)\alpha(G).$ Additional thanks to: Noga Alon SOLVED Let$c,\epsilon>0$and$n$be sufficiently large. If$A\subset \mathbb{N}$has$\lvert A\rvert=n$and$G$is any graph on$A$with at least$n^{1+c}$edges then $\max(\lvert A+_GA\rvert,\lvert A\cdot_G A\rvert) \geq \lvert A\rvert^{1+c-\epsilon},$ where $A+_GA = \{ a+b : (a,b)\in G\}$ and similarly for$A\cdot_GA$. A problem of Erdős and Szemerédi, which strengthens the conjecture [52]. This strong conjecture was disproved by Alon, Ruzsa, and Solymosi [ARS20], who constructed (for arbitrarily large$n$) a set of integers$A$with$\lvert A\rvert=n$and a graph$G$with$\gg n^{5/3-o(1)}$many edges such that $\max(\lvert A+_GA\rvert,\lvert A\cdot_G A\rvert) \ll \lvert A\rvert^{4/3+o(1)}.$ Alon, Ruzsa, and Solymosi do prove, however, that if$A$has size$n$and$G$has$m$edges then $\max(\lvert A+_GA\rvert,\lvert A\cdot_G A\rvert) \gg m^{3/2}n^{-7/4}.$ Additional thanks to: Noga Alon OPEN Let$k\geq 3$and define$F_k(n)$to be the minimal$r$such that there is a graph$G$on$n$vertices with$\lfloor n^2/4\rfloor+1$many edges such that the edges can be$r$-coloured so that every subgraph isomorphic to$C_{2k+1}$has no colour repeating on the edges. Is it true that $F_k(n)\sim n^2/8?$ A problem of Burr, Erdős, Graham, and Sós, who proved that $F_k(n)\gg n^2.$ See also [810]. OPEN Does there exist some$\epsilon>0$such that, for all sufficiently large$n$, there exists a graph$G$on$n$vertices with at least$\epsilon n^2$many edges such that the edges can be coloured with$n$colours so that every$C_4$receives$4$distinct colours? A problem of Burr, Erdős, Graham, and Sós. See also [809]. OPEN For which graphs$G$does the following hold: for all large$n$there exists some$d_G(n)$such that if$n$is sufficiently large and the edges of$K_n$are coloured with$e(G)$many colours such that the minimum degree of each colour class is$\geq d_G(n)$then there is a subgraph isomorphic to$G$where each edge receives a different colour? If$d_G(n)$exists then determine the best possible value of$d_G(n)$. A problem of Erdős, Pyber, and Tuza, who observe that if$d_G(n)$exists then$d_G(n) < \frac{n-1}{e(G)}$. The Kürschák competition in Hungary in 1986 asked students to prove that$d_{K_3}(n)$exists. Kostochka proved that$d_{K_3}(n)=n/4$is the best possible. Tuza proved that $d_{C_4}(n) \leq \left(\frac{1}{4}-c\right)n$ for some constant$c>0$. Brightwell and Trotter proved that $d_{C_6}(n) > (1-o(1))\frac{n}{6}.$ OPEN Is it true that $\frac{R(n+1)}{R(n)}\geq 1+c$ for some constant$c>0$, for all large$n$? Is it true that $R(n+1)-R(n) \gg n^2?$ Burr, Erdős, Faudree, and Schelp [BEFS89] proved that $R(n+1)-R(n) \geq 4n-8$ for all$n\geq 2$. The lower bound of [165] implies that $R(n+2)-R(n) \gg n^{2-o(1)}.$ OPEN Let$h(n)$be minimal such that every graph on$n$vertices where every set of$7$vertices contains a triangle (a copy of$K_3$) must contain a clique on at least$h(n)$vertices. Estimate$h(n)$- in particular, do there exist constants$c_1,c_2>0$such that $n^{1/3+c_1}\ll h(n) \ll n^{1/2-c_2}?$ A problem of Erdős and Hajnal, who could prove that $n^{1/3}\ll h(n) \ll n^{1/2}.$ Bucić and Sudakov [BuSu23] have proved $h(n) \gg n^{5/12-o(1)}.$ Additional thanks to: Zach Hunter SOLVED Let$k\geq 2$and$G$be a graph with$n\geq k-1$vertices and $(k-1)(n-k+2)+\binom{k-2}{2}+1$ edges. Does there exist some$c_k>0$such that$G$must contain an induced subgraph on at most$(1-c_k)n$vertices with minimum degree at least$k$? The case$k=3$was a problem of Erdős and Hajnal [Er91]. The question for general$k$was a conjecture of Erdős, Faudree, Rousseau, and Schelp [EFRS90], who proved that such a subgraph exists with at most$n-c_k\sqrt{n}$vertices. Mousset, Noever, and Skorić [MNS17] improved this to $n-c_k\frac{n}{\log n}.$ The full conjecture was proved by Sauermann [Sa19], who proved this with$c_k \gg 1/k^3$. Additional thanks to: Zach Hunter OPEN Let$k\geq 3$and$n$be sufficiently large. Is it true that if$G$is a graph with$n$vertices and$2n-2$edges such that every proper induced subgraph has minimum degree$\leq 2$then$G$must contain a copy of$C_k$? A problem of Erdős and Hajnal, who could prove it for$3\leq k\leq 6$. OPEN Let$G$be a graph with$2n+1$vertices and$n^2+n+1$edges. Must$G$contain two vertices of the same degree which are joined by a path of length$3$? A problem of Erdős and Hajnal. The example of$K_{n,n+1}$shows that this fails if we only have$n^2+n$edges. SOLVED Let$r\geq 3$and$k$be sufficiently large in terms of$r$. Is it true that every$r$-uniform hypergraph with chromatic number$k$has at least $\binom{(r-1)(k-1)+1}{r}$ edges, with equality only for the complete graph on$(r-1)(k-1)+1$vertices? When$r=2$it is a classical fact that chromatic number$k$implies at least$\binom{k}{2}$edges. Erdős asked for$k$to be large in this conjecture since he knew it to be false for$r=k=3$, as witnessed by the Steiner triples with$7$vertices and$7$edges. This was disproved by Alon [Al85], who proved, for example, that there exists some absolute constant$C>0$such that if$r\geq C$and$k\geq Cr$then there exists an$r$-uniform hypergraph with chromatic number$\geq k$with at most $\leq (7/8)^r\binom{(r-1)(k-1)+1}{r}$ many edges. In general, Alon gave an upper bound for the minimal number of edges using Turán numbers. Using known bounds for Turán numbers then suffices to disprove this conjecture for all$r\geq 4$. The validity of this conjecture for$r=3$remains open. If$m(r,k)$denotes the minimal number of edges of any$r$-uniform hypergraph with chromatic number$>k$then Akolzin and Shabanov [AkSh16] have proved $\frac{r}{\log r}k^r \ll m(r,k) \ll (r^3\log r) k^r,$ where the implied constants are absolute. Cherkashin and Petrov [ChPe20] have proved that, for fixed$r$,$m(r,k)/k^r$converges to some limit as$k\to \infty$. Additional thanks to: Zach Hunter SOLVED Does there exist an absolute constant$c>0$such that, for all$r\geq 2$, in any$r$-uniform hypergraph with chromatic number$3$there is a vertex contained in at least$(1+c)^r$many edges? In general, determine the largest integer$f(r)$such that every$r$-uniform hypergraph with chromatic number$3$has a vertex contained in at least$f(r)$many edges. It is easy to see that$f(2)=2$and$f(3)=3$. Erdős did not know the value of$f(4)$. This was solved by Erdős and Lovász [ErLo75], who proved in particular that there is a vertex contained in at least $\frac{3^{r-1}}{4r}$ many edges. Additional thanks to: Zach Hunter OPEN Does there exist a$3$-critical$3$-uniform hypergraph in which every vertex has degree$\geq 7$? A problem of Erdős and Lovász. We say that a hypergraph is$3$-critical if it contains three pairwise disjoint edges and removing any edge creates a hypergraph which contains at most two pairwise disjoint edges. OPEN Does there exist a$k>2$such that the$k$-sized subsets of$\{1,\ldots,2k\}$can be coloured with$k+1$colours such that for every$A\subset \{1,\ldots,2k\}$with$\lvert A\rvert=k+1$all$k+1$colours appear among the$k$-sized subsets of$A$? A problem of Erdős and Rosenfeld. This is trivially possible for$k=2$. They were not sure about$k=6$. OPEN Let$r\geq 2$and$G$be a$r$-uniform hypergraph with chromatic number$3$, such that any two edges have non-empty intersection. Must$G$contain$O(r^2)$many vertices? Must there be two edges which meet in$\gg r$many vertices? A problem of Erdős and Shelah. The Fano geometry gives an example where there are no two edges which meet in$r-1$vertices. Are there any other examples? Erdős and Lovász [ErLo75] proved that there must be two edges which meet in$\gg \frac{r}{\log r}$many vertices. OPEN Let$k\geq 2$and$A_k\subseteq [0,1]$be the set of$\alpha$such that there exists some$\beta(\alpha)>\alpha$with the property that, if$G_1,G_2,\ldots$is a sequence of$k$-uniform hypergraphs with $\liminf \frac{e(G_n)}{\binom{\lvert G_n\rvert}{k}} >\alpha$ then there exist subgraphs$H_n\subseteq G_n$such that$\lvert H_n\rvert \to \infty$and $\liminf \frac{e(H_n)}{\binom{\lvert H_n\rvert}{k}} >\beta,$ and further that this property does not necessarily hold if$>\alpha$is replaced by$\geq \alpha$. What is$A_3\$?

A problem of Erdős and Simonovits. It is known that $A_2 = \left\{ 1-\frac{1}{k} : k\geq 1\right\}.$