Skip to content

Problems · Vela Mathematics Program

Narrowed toramsey theory ×Clear all

Problem ledger

114 problems · 3/3NumberSourcesGraph view
declared proved · formalizederdos:1105
True ↔ ∀ (k : ℕ), 3 ≤ k → (fun n => ↑((SimpleGraph.cycleGraph k).antiRamseyNum n) - ((↑k - 2) / 2 + 1 / (↑k - 1)) * ↑n) =O[Filter.atTop] fun x => 1
graph theoryramsey theorypossible3 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 openerdos:1168
Erdős problem 1168
set theoryramsey theoryN/A
declared not disprovableerdos:1169
Erdős problem 1169
set theoryramsey theoryN/A
declared openerdos:1170
Erdős problem 1170
set theoryramsey theoryN/A
declared openerdos:1171
Erdős problem 1171
set theoryramsey theoryN/A
declared openerdos:1172
Erdős problem 1172
set theoryramsey theoryN/A
declared not disprovableerdos:1174
Erdős problem 1174
set theoryramsey theoryN/A
declared openerdos:1182
Erdős problem 1182
graph theoryramsey theorypossible
declared openerdos:1183
Erdős problem 1183
combinatoricsramsey theorypossible2 sources
declared disprovederdos:1198
Erdős problem 1198
additive combinatoricsramsey theoryN/A
declared open · formalizederdos:1199
True ↔ ∀ (color : ℕ → Fin 2), ∃ A, A.Infinite ∧ ∀ n ∈ A + A, ∀ m ∈ A + A, color n = color m
additive combinatoricsramsey theorypossible2 sources
declared solvederdos:1211
Erdős problem 1211
number theoryramsey theorypossible
declared disprovederdos:1216
Erdős problem 1216
graph theoryramsey theorypossible

Search problems.science

Find a Problem, Result, source, or page