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
Paused
Erdős problem 835
Does there exist a k>2 such that the k-sized subsets of {1,...,2k} can be coloured with
k+1 colours such that for every A⊂{1,…,2k}
with
∣A∣=k+1
all
k+1
colours appear among the
k
-sized subsets of
A
?
Pin rotation in progress; nothing can be submitted right now.
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.