Questions, not proof records

Open-problem statements, with their sources attached.

Each statement record keeps the mathematical question, a dated status source, accessible references, and any pinned Lean formulation separate from proof verification.

“Open” is a dated source assertion. In these pinned sources, sorry marks an admitted statement, not a proof. Source indexing does not mean the formulation has been independently built or certified by Therefore.
All topics

371 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
Source labels openErdős Problems · Combinatorics

Erdős Problem 1175

Let κ\kappa be an uncountable cardinal. Must there exist a cardinal λ\lambda such that every graph with chromatic number λ\lambda contains a triangle-free subgraph with chromatic number κ\kappa?

Shelah proved that a negative answer is consistent when κ=λ=1\kappa = \lambda = \aleph_1 (see erdos_1175.variants.shelah_consistency).

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 1175: Threshold Formulation

Threshold reformulation variant.* Replaces chromaticCardinal = λ in the hypothesis of erdos_1175 with λ ≤ chromaticCardinal (a graph of chromatic number ≥ λ has a triangle-free subgraph of chromatic number κ). This is a strengthening of erdos_1175 (see erdos_1175.test.threshold_implies_exact).

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 1192

Does there exist, for all r2r\geq 2, a basis AA of order rr (so that fr(n)>0f_r(n)>0 for all large nn) such that nxfr(n)2x\sum_{n\leq x}f_r(n)^2 \ll x for all xx?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 1199

Is it true that in any 2-colouring of N\mathbb{N} there exists an infinite set AA such that all elements of A+AA+A are the same colour?

A conjecture of Owings [Ow74].

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 120

Let ARA \subseteq \mathbb{R} be an infinite set. Must there be a set ERE \subseteq \mathbb{R} of positive measure which does not contain any set of the shape aA+ba * A + b for some a,bRa,b \in \mathbb{R} and a0a \neq 0?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 128

Let G be a graph with n vertices such that every induced subgraph on ≥ n/2n/2 vertices has more than n2/50n^2/50 edges. Must G contain a triangle?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 13: General

A general version asks, for a fixed rNr \in \mathbb{N}, if a set A{1,...,N}A \subseteq \{1, ..., N\} has no aAa \in A and b1,...,brAb_1, ..., b_r \in A such that a(b1+...+br)a | (b_1 + ... + b_r) and a<min(b1,...,br)a < \min(b_1, ..., b_r), then is it true that AN/(r+1)+O(1)|A| \le N/(r+1) + O(1)?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 141

Let k3k≥3. Are there kk consecutive primes in arithmetic progression?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 141: Eleven

Are there 1111 consecutive primes in arithmetic progression?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 141: Infinite Three

It is open, even for k=3k=3, whether there are infinitely many such progressions.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 141: Infinite General Case

Fix a k3k \geq 3. Is it true that there are infinitely many arithmetic prime progressions of length kk?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 153

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

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 155

Is it true that for every k1k \geq 1 we have

F(N+k)F(N)+1F(N + k) \leq F(N) + 1

for all sufficiently large NN?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 156

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

A question of Erdős, Sárközy, and Sós [ESS94].

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 158

Let A be an infinite B₂[2] set. Must liminf |A ∩ {1, ..., N}| * N ^ (- 1 / 2) = 0?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 160: Better Upper

Estimate h(n)h(n) by finding a better upper bound.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 160: Better Lower

Estimate h(n)h(n) by finding a better lower bound.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 168: Ii

Is the limit F(N)/NF(N)/N as NN \to \infty irrational?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 170

The problem is to determine the limit of the sequence F(N)N\frac{F(N)}{\sqrt{N}} as NN \to \infty.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openErdős Problems · Combinatorics

Erdős Problem 172

Is it true that in any finite colouring of N\mathbb{N} there exist arbitrarily large finite AA such that all sums and products of distinct elements in AA are the same colour?

Source checked Jul 26, 20261 pinned Lean statementInspect problem