---

Claim. The preprint Erdős Matching (Conjecture) Theorem by Tapas Kumar Mishra, arXiv:2602.01471, posted on 2026-02-01, claimed a proof of the full conjecture of Problem 1020: that a family of $k$-subsets of an $n$-set with no $s$ pairwise disjoint members has at most $\max\{\binom{sk-1}{k},\binom nk-\binom{n-s+1}{k}\}$ members, the two extremal families being the clique and the cover, for every uniformity and matching number. A reader posted the preprint on the site's discussion thread on 2026-02-03.

Depends on. No page of this wiki.

Standing. Withdrawn. On the day of the thread post a commenter reported having contacted the author about a possible gap on p. 11, where the first shifts might not be available because the shifted sets already belong to the family; on 2026-02-07 the same commenter located the crucial mistake in Lemma 4, whose assertion that every shift fixes each member of the family in question fails, and gave a counterexample with explicit parameters. The preprint went through five revisions between 2026-02-04 and 2026-03-10, and its sixth version, of 2026-06-01, is a withdrawal whose comment states that the proof has a major error which the author is not able to fix. No proof claim was registered on the site's proof-claims tab, and the site's label and commentary, last edited on 28 December 2025, do not mention the preprint.