Every problem here was open when it entered the pool.
Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
Combinatorics
Erdős problem 564
Let R3(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
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.