A finite-board reduction for the Erdős Matching Conjecture and the 4-uniform case via exact certificates
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917532352380928 |
|---|---|
| author | Hou, Jianfeng Hu, Caiyun Liu, Xizhi |
| author_facet | Hou, Jianfeng Hu, Caiyun Liu, Xizhi |
| contents | We prove the 4-uniform Erdős Matching Conjecture for every matching number $s\ge 6961$. The proof has two parts. First, building on ideas from Frankl--Rödl--Ruciński, we formulate a general finite-board criterion for the $r$-uniform conjecture. The criterion has two assumptions: the $(r-1)$-uniform cover-side bound for links with matching number at most $t$ holds at every $m\ge n_r(t)$, and a finite optimization problem for mixed-size trace configurations on an $(r^2+r-1)$-vertex board. Together with the corresponding lower-uniformity input, this finite-board optimization implies the Erdős Matching Conjecture with explicit large-matching thresholds.
Second, we verify the finite-board assumption for $r=4$. The local board has 19 vertices, and the required inequality is decomposed into three weighted local inequalities: a leading wide layer, a 15-board layer, and an 11-board layer. The verification is reduced to exact finite optimization and certificate-validation problems: Ferrers down-set enumerations for pair and triple traces, rational Farkas-dual certificates for the top-star branch, integer branch-and-bound up-set hitting and pattern searches for the no-top-star branch, and residual-cut dual certificates for the 15-board and 11-board layers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_26060 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A finite-board reduction for the Erdős Matching Conjecture and the 4-uniform case via exact certificates Hou, Jianfeng Hu, Caiyun Liu, Xizhi Combinatorics We prove the 4-uniform Erdős Matching Conjecture for every matching number $s\ge 6961$. The proof has two parts. First, building on ideas from Frankl--Rödl--Ruciński, we formulate a general finite-board criterion for the $r$-uniform conjecture. The criterion has two assumptions: the $(r-1)$-uniform cover-side bound for links with matching number at most $t$ holds at every $m\ge n_r(t)$, and a finite optimization problem for mixed-size trace configurations on an $(r^2+r-1)$-vertex board. Together with the corresponding lower-uniformity input, this finite-board optimization implies the Erdős Matching Conjecture with explicit large-matching thresholds. Second, we verify the finite-board assumption for $r=4$. The local board has 19 vertices, and the required inequality is decomposed into three weighted local inequalities: a leading wide layer, a 15-board layer, and an 11-board layer. The verification is reduced to exact finite optimization and certificate-validation problems: Ferrers down-set enumerations for pair and triple traces, rational Farkas-dual certificates for the top-star branch, integer branch-and-bound up-set hitting and pattern searches for the no-top-star branch, and residual-cut dual certificates for the 15-board and 11-board layers. |
| title | A finite-board reduction for the Erdős Matching Conjecture and the 4-uniform case via exact certificates |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2605.26060 |