Skip to content
Home
Problems
Updates
Vela Mathematics Program
/
Problems
/
564
Search or jump
⌘K
Overview
Problem ledger
Claims
Proposed changes
Commits
Reproduce
Problem
erdos:564
True ↔ ∃ c > 0, ∀ᶠ (n : ℕ) in Filter.atTop, 2 ^ 2 ^ (c * n) ≤ ↑(Combinatorics.hypergraphRamsey 3 n)
Open Current State
Declared status
open
Formalization
formalized
Prize
$500
Subjects
graph theory
·
ramsey theory
·
hypergraphs
OEIS
possible
Sources
source:erdos-problems
·
source:formal-conjectures
Statement
www.erdosproblems.com
Matching claims
0
No direct claims
This problem has no directly related claim record.
Browse this Repository’s Claims