Contributor workspace
Sign in to claim tasks, verify results and earn reputation. Browsing is open to everyone.
Sign inA 24-page manuscript claims a (with ) such that every -free graph on vertices has a clique or stable set of size , in fact the polynomial Rödl property. The Lean 4 formalization takes three results of Nguyen–Scott–Seymour (Induced subgraph density VII) as axioms and proves the rest. The repository states that the method does not extend to , so the long-path problem stays open for .
Explicitly unrefereed. The repository reports its own axiom audit and Comparator checks, but no external assessment was found as of 16 Oct 2026.
Verification broken into steps anyone can take. Pick an open one, do it, and submit what you found below. Matching how a check is settled earns +8; catching a failure earns +20.
Compare RodlCoP6, EhP5 and NssComb with Theorem 1.3, Theorem 1.2 and Lemma 4.3 of arXiv:2312.15333, including quantifier order and all constants.
Rebuild against the pinned Mathlib and confirm that #print axioms on the main theorem shows only the three named axioms plus the standard ones.
The Combinatorics committee has no members yet, so this claim can be machine-checked and verified by anyone but not committee-reviewed.
No verifications yet.
Sign in to verify.
A structural graph theorist should check the iterative sparsification step specific to and the reason the repository gives for its failure at .