Unsolved Problems

Showing 101-150 of 662 problems (Page 3 of 14)

EP-125
Open

Erdős Problem #125

Let $A = \{ \sum\epsilon_k3^k : \epsilon_k\in \{0,1\}\}$ be the set of integers which have only the digits $0,1$ when written base $3$, and $B=\{ \sum...

L1
Number Theory
0
0
EP-126
Open

Erdős Problem #126

Let $f(n)$ be maximal such that if $A\subseteq\mathbb{N}$ has $\lvert A\rvert=n$ then $\prod_{a eq b\in A}(a+b)$ has at least $f(n)$ distinct prime fa...

L1
Number Theory
0
0
EP-129
Open

Erdős Problem #129

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

L1
Graph Theory
0
0
EP-130
Open

Erdős Problem #130

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 vertice...

L1
Number Theory
0
0
EP-131
Open

Erdős Problem #131

Let $F(N)$ be the maximal size of $A\subseteq\{1,\ldots,N\}$ such that no $a\in A$ divides the sum of any distinct elements of $A\backslash\{a\}$. Est...

L1
Combinatorics
0
0
EP-132
Open

Erdős Problem #132

Let $A\subset \mathbb{R}^2$ be a set of $n$ points. Must there be two distances which occur at least once but between at most $n$ pairs of points? Mus...

L1
Graph Theory
0
0
EP-137
Open

Erdős Problem #137

We say that $N$ is powerful if whenever $p\mid N$ we also have $p^2\mid N$. Let $k\geq 3$. Can the product of any $k$ consecutive positive integers ev...

L1
Number Theory
0
0
EP-138
Open

Erdős Problem #138

Let the van der Waerden number $W(k)$ be such that whenever $N\geq W(k)$ and $\{1,\ldots,N\}$ is $2$-coloured there must exist a monochromatic $k$-ter...

L1
Number Theory
0
0
EP-142
Open

Erdős Problem #142

Let $r_k(N)$ be the largest possible size of a subset of $\{1,\ldots,N\}$ that does not contain any non-trivial $k$-term arithmetic progression. Prove...

L1
Combinatorics
0
0
EP-143
Open

Erdős Problem #143

Let $A\subset (1,\infty)$ be a countably infinite set such that for all $x eq y\in A$ and integers $k\geq 1$ we have $ \lvert kx -y\rvert \geq 1. $ D...

L1
Number Theory
0
0
EP-145
Open

Erdős Problem #145

Let $s_1<s_2<\cdots$ be the sequence of squarefree numbers. Is it true that, for any $\alpha \geq 0$, $ \lim_{x\to \infty}\frac{1}{x}\sum_{s_n\leq x}(...

L1
Combinatorics
0
0
EP-146
Open

Erdős Problem #146

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}. ...

L1
Number Theory
0
0
EP-148
Open

Erdős Problem #148

Let $F(k)$ be the number of solutions to $ 1= \frac{1}{n_1}+\cdots+\frac{1}{n_k}, $ where $1\leq n_1<\cdots<n_k$ are distinct integers. Find good est...

L1
Number Theory
0
0
EP-149
Open

Erdős Problem #149

Let $G$ be a graph with maximum degree $\Delta$. Is $G$ the union of at most $\tfrac{5}{4}\Delta^2$ sets of strongly independent edges (sets such that...

L1
Graph Theory
0
0
EP-151
Open

Erdős Problem #151

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

L1
Graph Theory
0
0
EP-152
Open

Erdős Problem #152

For any $M\geq 1$, if $A\subset \mathbb{N}$ is a sufficiently large finite Sidon set then there are at least $M$ many $a\in A+A$ such that $a+1,a-1 ot...

L1
Combinatorics
0
0
EP-153
Open

Erdős Problem #153

Let $A$ be a finite Sidon set and $A+A=\{s_1<\cdots<s_t\}$. Is it true that $ \frac{1}{t}\sum_{1\leq i<t}(s_{i+1}-s_i)^2 \to \infty $ as $\lvert A\rve...

L1
Combinatorics
0
0
EP-155
Open

Erdős Problem #155

Let $F(N)$ be the size of the largest Sidon subset of $\{1,\ldots,N\}$. Is it true that for every $k\geq 1$ we have $ F(N+k)\leq F(N)+1 $ for all suff...

L1
Combinatorics
0
0
EP-156
Open

Erdős Problem #156

Does there exist a maximal Sidon set $A\subset \{1,\ldots,N\}$ of size $O(N^{1/3})$?...

L1
Combinatorics
0
0
EP-158
Open

Erdős Problem #158

Let $A\subset \mathbb{N}$ be an infinite set such that, for any $n$, there are most $2$ solutions to $a+b=n$ with $a\leq b$. Must $ \liminf_{N\to\inft...

L1
Combinatorics
0
0
EP-159
Open

Erdős Problem #159

There exists some constant $c>0$ such that $$R(C_4,K_n) \ll n^{2-c}.$$...

L1
Graph Theory
0
0
EP-160
Open

Erdős Problem #160

Let $h(N)$ be the smallest $k$ such that $\{1,\ldots,N\}$ can be coloured with $k$ colours so that every four-term arithmetic progression must contain...

L1
Combinatorics
0
0
EP-161
Open

Erdős Problem #161

Let $\alpha\in[0,1/2)$ and $n,t\geq 1$. Let $F^{(t)}(n,\alpha)$ be the smallest $m$ such that we can $2$-colour the edges of the complete $t$-uniform ...

L1
Graph Theory
0
0
EP-162
Open

Erdős Problem #162

Let $\alpha>0$ and $n\geq 1$. Let $F(n,\alpha)$ be the largest $k$ such that there exists some 2-colouring of the edges of $K_n$ in which any induced ...

L1
Graph Theory
0
0
EP-165
Open

Erdős Problem #165

Give an asymptotic formula for $R(3,k)$....

L1
Graph Theory
0
0
EP-168
Open

Erdős Problem #168

Let $F(N)$ be the size of the largest subset of $\{1,\ldots,N\}$ which does not contain any set of the form $\{n,2n,3n\}$. What is $ \lim_{N\to \inft...

L1
Combinatorics
0
0
EP-169
Open

Erdős Problem #169

Let $k\geq 3$ and $f(k)$ be the supremum of $\sum_{n\in A}\frac{1}{n}$ as $A$ ranges over all sets of positive integers which do not contain a $k$-ter...

L1
Number Theory
0
0
EP-170
Open

Erdős Problem #170

Let $F(N)$ be the smallest possible size of $A\subset \{0,1,\ldots,N\}$ such that $\{0,1,\ldots,N\}\subset A-A$. Find the value of $ \lim_{N\to \infty...

L1
Combinatorics
0
0
EP-172
Open

Erdős Problem #172

Is it true that in any finite colouring of $\mathbb{N}$ there exist arbitrarily large finite $A$ such that all sums and products of distinct elements ...

L1
Number Theory
0
0
EP-173
Open

Erdős Problem #173

In any $2$-colouring of $\mathbb{R}^2$, for all but at most one triangle $T$, there is a monochromatic congruent copy of $T$....

L1
Graph Theory
0
0
EP-174
Open

Erdős Problem #174

A finite set $A\subset \mathbb{R}^n$ is called Ramsey if, for any $k\geq 1$, there exists some $d=d(A,k)$ such that in any $k$-colouring of $\mathbb{R...

L1
Number Theory
0
0
EP-176
Open

Erdős Problem #176

Let $N(k,\ell)$ be the minimal $N$ such that for any $f:\{1,\ldots,N\}\to\{-1,1\}$ there must exist a $k$-term arithmetic progression $P$ such that $ ...

L1
Combinatorics
0
0
EP-177
Open

Erdős Problem #177

Find the smallest $h(d)$ such that the following holds. There exists a function $f:\mathbb{N}\to\{-1,1\}$ such that, for every $d\geq 1$, $ \max_{P_d}...

L1
Number Theory
0
0
EP-180
Open

Erdős Problem #180

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 wi...

L1
Graph Theory
0
0
EP-181
Open

Erdős Problem #181

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

L1
Graph Theory
0
0
EP-183
Open

Erdős Problem #183

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. Determin...

L1
Number Theory
0
0
EP-184
Open

Erdős Problem #184

Any graph on $n$ vertices can be decomposed into $O(n)$ many edge-disjoint cycles and edges....

L1
Graph Theory
0
0
EP-187
Open

Erdős Problem #187

Find the best function $f(d)$ such that, in any 2-colouring of the integers, at least one colour class contains an arithmetic progression with common ...

L1
Number Theory
0
0
EP-188
Open

Erdős Problem #188

What is the smallest $k$ such that $\mathbb{R}^2$ can be red/blue coloured with no pair of red points unit distance apart, and no $k$-term arithmetic ...

L1
Number Theory
0
0
EP-190
Open

Erdős Problem #190

Let $H(k)$ be the smallest $N$ such that in any finite colouring of $\{1,\ldots,N\}$ (into any number of colours) there is always either a monochromat...

L1
Graph Theory
0
0
EP-193
Open

Erdős Problem #193

Let $S\subseteq \mathbb{Z}^3$ be a finite set and let $A=\{a_1,a_2,\ldots,\}\subset \mathbb{Z}^3$ be an infinite $S$-walk, so that $a_{i+1}-a_i\in S$ ...

L1
Combinatorics
0
0
EP-195
Open

Erdős Problem #195

What is the largest $k$ such that in any permutation of $\mathbb{Z}$ there must exist a monotone $k$-term arithmetic progression $x_1<\cdots<x_k$?...

L1
Number Theory
0
0
EP-196
Open

Erdős Problem #196

Must every permutation of $\mathbb{N}$ contain a monotone 4-term arithmetic progression? In other words, given a permutation $x$ of $\mathbb{N}$ must ...

L1
Combinatorics
0
0
EP-197
Open

Erdős Problem #197

Can $\mathbb{N}$ be partitioned into two sets, each of which can be permuted to avoid monotone 3-term arithmetic progressions?...

L1
Number Theory
0
0
EP-200
Open

Erdős Problem #200

Does the longest arithmetic progression of primes in $\{1,\ldots,N\}$ have length $o(\log N)$?...

L1
Number Theory
0
0
EP-201
Open

Erdős Problem #201

Let $G_k(N)$ be such that any set of $N$ integers contains a subset of size at least $G_k(N)$ which does not contain a $k$-term arithmetic progression...

L1
Number Theory
0
0
EP-202
Open

Erdős Problem #202

Let $n_1<\cdots < n_r\leq N$ with associated $a_i\pmod{n_i}$ such that the congruence classes are disjoint (that is, every integer is $\equiv a_i\pmod...

L1
Number Theory
0
0
EP-203
Open

Erdős Problem #203

Is there an integer $m\geq 1$ with $(m,6)=1$ such that none of $2^k3^\ell m+1$ are prime, for any $k,\ell\geq 0$?...

L1
Number Theory
0
0
EP-208
Open

Erdős Problem #208

Let $s_1<s_2<\cdots$ be the sequence of squarefree numbers. Is it true that, for any $\epsilon>0$ and large $n$, $ s_{n+1}-s_n \ll_\epsilon s_n^{\epsi...

L1
Combinatorics
0
0
EP-212
Open

Erdős Problem #212

Is there a dense subset of $\mathbb{R}^2$ such that all pairwise distances are rational?...

L1
Combinatorics
0
0