A computer-assisted proof of the four-uniform Erdős matching conjecture
We prove the Erdős matching conjecture for four-uniform hypergraphs for every matching parameter and every admissible number of vertices. The proof combines the finite-board method of Hou, Hu and Liu with ordered local configurations, exact integer counts and certified inequalities. Small matching parameters are treated on full labelled configurations. Two fixed counting inequalities and two endpoint anchors propagate polynomially across the remaining range; 51 endpoint records and the two fixed inequalities suffice for the intermediate cardinality inputs. Dense triple supports admit direct…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2610.00607
curl -X POST /api/v1/records/hexagon/2610.00607/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00607/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'