Erdős Problem #719
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 ...
Erdős Problem #724
Let $f(n)$ be the maximum number of mutually orthogonal Latin squares of order $n$. Is it true that $ f(n) \gg n^{1/2}? $ ...
Erdős Problem #725
Give an asymptotic formula for the number of $k\times n$ Latin rectangles....
Erdős Problem #726
As $n\to \infty$ ranges over integers $ \sum_{p\leq n}1_{n\in (p/2,p)\pmod{p}}\frac{1}{p}\sim \frac{\log\log n}{2}. $ ...
Erdős Problem #727
Let $k\geq 2$. Does $ (n+k)!^2 \mid (2n)! $ for infinitely many $n$?...
Erdős Problem #730
Are there infinitely many pairs of integers $n eq m$ such that $\binom{2n}{n}$ and $\binom{2m}{m}$ have the same set of prime divisors?...
Erdős Problem #731
Find some reasonable function $f(n)$ such that, for almost all integers $n$, the least integer $m$ such that $m mid \binom{2n}{n}$ satisfies $ m\sim f...
Erdős Problem #734
Find, for all large $n$, a non-trivial pairwise balanced block design $A_1,\ldots,A_m\subseteq \{1,\ldots,n\}$ such that, for all $t$, there are $O(n^...
Erdős Problem #738
If $G$ has infinite chromatic number and is triangle-free (contains no $K_3$) then must $G$ contain every tree as an induced subgraph? ", "difficu...
Erdős Problem #740
Let $\mathfrak{m}$ be an infinite cardinal and $G$ be a graph with chromatic number $\mathfrak{m}$. Let $r\geq 1$. Must $G$ contain a subgraph of chro...
Erdős Problem #741
Let $A\subseteq \mathbb{N}$ be such that $A+A$ has positive density. Can one always decompose $A=A_1\sqcup A_2$ such that $A_1+A_1$ and $A_2+A_2$ both...
Erdős Problem #749
Let $\epsilon>0$. Does there exist $A\subseteq \mathbb{N}$ such that the lower density of $A+A$ is at least $1-\epsilon$ and yet $1_A\ast 1_A(n) \ll_\...
Erdős Problem #750
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 sub...
Erdős Problem #757
Let $A\subset \mathbb{R}$ be a set of size $n$ such that every subset $B\subseteq A$ with $\lvert B\rvert =4$ has $\lvert B-B\rvert\geq 11$. Find the ...
Erdős Problem #761
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 clas...
Erdős Problem #766
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 rang...
Erdős Problem #768
Let $A\subset\mathbb{N}$ be the set of $n$ such that for every prime $p\mid n$ there exists some $d\mid n$ with $d>1$ such that $d\equiv 1\pmod{p}$. I...
Erdős Problem #769
Let $c(n)$ be minimal such that if $k\geq c(n)$ then the $n$-dimensional unit cube can be decomposed into $k$ homothetic $n$-dimensional cubes. Give g...
Erdős Problem #770
Let $h(n)$ be minimal such that $2^n-1,3^n-1,\ldots,h(n)^n-1$ are mutually coprime. Does, for every prime $p$, the density $\delta_p$ of integers with...
Erdős Problem #773
What is the size of the largest Sidon subset $A\subseteq\{1,2^2,\ldots,N^2\}$? Is it $N^{1-o(1)}$?...
Erdős Problem #774
We call $A\subset \mathbb{N}$ dissociated if $\sum_{n\in X}n eq \sum_{m\in Y}m$ for all finite $X,Y\subset A$ with $X eq Y$. Let $A\subset \mathbb{N}$...
Erdős Problem #776
Let $r\geq 2$ and $A_1,\ldots,A_m\subseteq \{1,\ldots,n\}$ be such that $A_i ot\subseteq A_j$ for all $i eq j$ and for any $t$ if there exists some $i...
Erdős Problem #778
Alice and Bob play a game on the edges of $K_n$, alternating colouring edges by red (Alice) and blue (Bob). Alice goes first, and wins if at the end t...
Erdős Problem #782
Do the squares contain arbitrarily long quasi-progressions? That is, does there exist some constant $C>0$ such that, for any $k$, the squares contain ...
Erdős Problem #783
Fix some constant $C>0$ and let $n$ be large. Let $A\subseteq \{2,\ldots,n\}$ be such that $(a,b)=1$ for all $a eq b\in A$ and $\sum_{n\in A}\frac{1}{...
Erdős Problem #786
Let $\epsilon>0$. Is there some set $A\subset \mathbb{N}$ of density $>1-\epsilon$ such that $a_1\cdots a_r=b_1\cdots b_s$ with $a_i,b_j\in A$ can onl...
Erdős Problem #787
Let $g(n)$ be maximal such that given any set $A\subset \mathbb{R}$ with $\lvert A\rvert=n$ there exists some $B\subseteq A$ of size $\lvert B\rvert\g...
Erdős Problem #788
Let $f(n)$ be maximal such that if $B\subset (2n,4n)\cap \mathbb{N}$ there exists some $C\subset (n,2n)\cap \mathbb{N}$ such that $c_1+c_2 ot\in B$ fo...
Erdős Problem #789
Let $h(n)$ be maximal such that if $A\subseteq \mathbb{Z}$ with $\lvert A\rvert=n$ then there is $B\subseteq A$ with $\lvert B\rvert \geq h(n)$ such t...
Erdős Problem #790
Let $l(n)$ be maximal such that if $A\subset\mathbb{Z}$ with $\lvert A\rvert=n$ then there exists a sum-free $B\subseteq A$ with $\lvert B\rvert \geq ...
Erdős Problem #791
Let $g(n)$ be minimal such that there exists $A\subseteq \{0,\ldots,n\}$ of size $g(n)$ with $\{0,\ldots,n\}\subseteq A+A$. Estimate $g(n)$. In partic...
Erdős Problem #792
Let $f(n)$ be maximal such that in any $A\subset \mathbb{Z}$ with $\lvert A\rvert=n$ there exists some sum-free subset $B\subseteq A$ with $\lvert B\r...
Erdős Problem #793
Let $F(n)$ be the maximum possible size of a subset $A\subseteq\{1,\ldots,n\}$ such that $a mid bc$ whenever $a,b,c\in A$ with $a eq b$ and $a eq c$. ...
Erdős Problem #796
Let $k\geq 2$ and let $g_k(n)$ be the largest possible size of $A\subseteq \{1,\ldots,n\}$ such that every $m$ has $<k$ solutions to $m=a_1a_2$ with $...
Erdős Problem #802
Is it true that any $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?...
Erdős Problem #805
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...
Erdős Problem #809
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 t...
Erdős Problem #810
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$ ma...
Erdős Problem #811
Suppose $n\equiv 1\pmod{m}$. We say that an edge-colouring of $K_n$ using $m$ colours is balanced if every vertex sees exactly $\lfloor n/m\rfloor$ ma...
Erdős Problem #812
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? $ ...
Erdős Problem #813
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 cliqu...
Erdős Problem #817
Let $k\geq 3$ and define $g_k(n)$ to be the minimal $N$ such that $\{1,\ldots,N\}$ contains some $A$ of size $\lvert A\rvert=n$ such that $ \langle A\...
Erdős Problem #819
Let $f(N)$ be maximal such that there exists $A\subseteq \{1,\ldots,N\}$ with $\lvert A\rvert=\lfloor N^{1/2}\rfloor$ such that $\lvert (A+A)\cap [1,N...
Erdős Problem #820
Let $H(n)$ be the smallest integer $l$ such that there exist $k<l$ with $(k^n-1,l^n-1)=1$. Is it true that $H(n)=3$ infinitely often? (That is, $(2^n-...
Erdős Problem #821
Let $g(n)$ count the number of $m$ such that $\phi(m)=n$. Is it true that, for every $\epsilon>0$, there exist infinitely many $n$ such that $ g(n) > ...
Erdős Problem #824
Let $h(x)$ count the number of integers $1\leq a<b<x$ such that $(a,b)=1$ and $\sigma(a)=\sigma(b)$, where $\sigma$ is the sum of divisors function. I...
Erdős Problem #825
Is there an absolute constant $C>0$ such that every integer $n$ with $\sigma(n)>Cn$ is the distinct sum of proper divisors of $n$?...
Erdős Problem #826
Are there infinitely many $n$ such that, for all $k\geq 1$, $ \tau(n+k)\ll k? $ ...
Erdős Problem #827
Let $n_k$ be minimal such that if $n_k$ points in $\mathbb{R}^2$ are in general position then there exists a subset of $k$ points such that all $\bino...
Erdős Problem #828
Is it true that, for any $a\in\mathbb{Z}$, there are infinitely many $n$ such that $ \phi(n) \mid n+a? $ ...