Skip to content

Problems · Vela Mathematics Program

Narrowed todisproved ×Clear all

Problem ledger

69 problems · 2/2NumberSourcesGraph view
declared disproved · formalizederdos:847
False ↔ ∀ (A : Set ℕ), Infinite ↑A → Erdos847.HasFew3APs A → ∃ n S, (∀ (i : Fin n), ThreeAPFree (S i)) ∧ A = ⋃ i, S i
additive combinatoricsN/A3 sources
declared disprovederdos:869
Erdős problem 869
number theoryadditive basisN/A
declared disprovederdos:910
Erdős problem 910
topologyN/A
declared disprovederdos:925
Erdős problem 925
graph theoryramsey theorypossible
declared disprovederdos:960
Erdős problem 960
geometrypossible3 sources
declared disproved · formalizederdos:965
False ↔ ∀ (f : ℝ → Fin 2), ∃ A, ¬A.Countable ∧ ∀ a ∈ A, ∀ b ∈ A, ∀ c ∈ A, ∀ d ∈ A, a ≠ b → c ≠ d → f (a + b) = f (c + d)
ramsey theoryN/A2 sources
declared disprovederdos:992
Erdős problem 992
discrepancyN/A
declared disprovederdos:994
Erdős problem 994
analysisdiscrepancyN/A
declared disprovederdos:1006
Erdős problem 1006
graph theorycyclesN/A
declared disprovederdos:1046
Erdős problem 1046
analysisN/A
declared disproved · formalizederdos:1077
False ↔ ∀ ε > 0, ε < 1 → ∀ α > 0, α < 1 → ∀ᶠ (D : ℝ) in Filter.atTop, ∀ᶠ (n : ℕ) in Filter.atTop, ∀ (G : SimpleGraph (Fin n)), ↑G.edgeSet.ncard > ↑n ^ (1 + α) → ∃ H, H.coe.IsBalanced D ∧ ↑H.verts.ncard > ↑n ^ (1 - α) ∧ ↑H.edgeSet.ncard > ε * ↑H.verts.ncard ^ (1 + α)
graph theoryN/A2 sources
declared disprovederdos:1081
Erdős problem 1081
number theorypowerfulA076871 · A076872 · possible
declared disproved · formalizederdos:1092
False ↔ (fun n => ↑n) =o[Filter.atTop] fun n => ↑(Erdos1092.f 2 n)
geometrychromatic numberN/A5 sources
declared disproved · formalized · $50erdos:1128
False ↔ ∀ (A B C : Type), Cardinal.mk A = Cardinal.aleph 1 → Cardinal.mk B = Cardinal.aleph 1 → Cardinal.mk C = Cardinal.aleph 1 → ∀ (f : A → B → C → Fin 2), ∃ A₁ B₁ C₁, Cardinal.mk ↑A₁ = Cardinal.aleph 0 ∧ Cardinal.mk ↑B₁ = Cardinal.aleph 0 ∧ Cardinal.mk ↑C₁ = Cardinal.aleph 0 ∧ Erdos1128.IsMonochromaticBox f A₁ B₁ C₁
set theoryramsey theoryhypergraphsN/A2 sources
declared disprovederdos:1140
Erdős problem 1140
number theorypossible
declared disprovederdos:1147
Erdős problem 1147
irrationaladditive basisN/A
declared disprovederdos:1198
Erdős problem 1198
additive combinatoricsramsey theoryN/A
declared disprovederdos:1215
Erdős problem 1215
analysisN/A
declared disprovederdos:1216
Erdős problem 1216
graph theoryramsey theorypossible

Search problems.science

Find a Problem, Result, source, or page