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 184
Any graph on n vertices can be decomposed into O(n) many edge-disjoint cycles and edges.
Erdős, P., Some unsolved problems in graph theory and combinatorial analysis. Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969) (1971), 97-109.
No one has attempted this yet.
Formal statement
Lean type
∃ f,
(f =O[Filter.atTop] fun n => ↑n) ∧
∀ {V : Type u_1} [inst : Fintype V] [DecidableEq V] (G : SimpleGraph V),
∃ D, (∀ H ∈ D, Erdos184.IsCycleOrEdge H.coe) ∧ Erdos184.IsDecomposition G D ∧ ↑D.card ≤ f (Fintype.card V)
What you must prove
import FormalConjectures.ErdosProblems.«184»
import TaskSupport
namespace Bounty
theorem target : ¬ (fcTypeOfName% "Erdos184.erdos_184") := by
sorry
end Bounty
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.