Erdős problem 564 · problems.science

Let $R_3(n)$ be the minimal $m$ such that if the edges of the $3$ -uniform hypergraph on $m$ vertices are $2$ -coloured then there is a monochromatic copy of the complete $3$ -uniform hypergraph on $n$ vertices.

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/564.lean

Formal Conjectures

FormalConjectures/ErdosProblems/564.leanErdos564.erdos_5641 lineExact file

1True ↔ ∃ c > 0, ∀ᶠ (n : ℕ) in Filter.atTop, 2 ^ 2 ^ (c * n) ≤ ↑(Combinatorics.hypergraphRamsey 3 n)

OpenStatement only, no proof

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Continue

Search problems.science