A ten-pair covering theorem for two-intersecting six-uniform families

A pair cover of a family of sets is a collection of two-element sets such that each member of the family contains a whole selected pair. We prove that every two-intersecting family of six-element sets, on an arbitrary ground set, has a cover by at most ten pairs. The general upper bound of Aharoni and Zerbib gives fourteen in this case; the new bound, together with the classical eight-pair lower example, yields 8 ≤ g₁(6,2) ≤ 10. The proof successively excludes high intersections, high triple degree and pair degrees six, five and four. Complete physical supports and an isolated three-tail analysis then give uniqueness of exact two-point traces. A final incidence count and grouping of actual members assemble the cover. A compactness argument supplies one finite cover of a possibly infinite family. This independent preprint includes the manuscript, a detailed proof supplement with 424 source-located finite proof entries, the complete pinned Lean source project, mathematical certificates, frozen checker inputs and reproduction programs. Saved Lean build, axiom and dependency evidence is included; no new Lean compilation was performed for this preprint release. Default Windows integer and source checks passed; the reproduction commands and scope are documented in README.txt. The exact six-uniform pair-cover value remains undetermined. The companion five-uniform preprint determines g₁(5,2)=6. The articles share definitions, elementary covering tools and a verification framework. This six-uniform main theorem does not assume the five-uniform exact-value theorem; this record contains all source dependencies needed for its own reproduction. OpenAI’s ChatGPT was used primarily for translation, assistance with the Lean 4 formalization, and revisions to the manuscript wording. The author is responsible for checking all mathematical and formal details and takes responsibility for the final manuscript and formalization. License scope: manuscript and original mathematical certificate data are CC BY 4.0; original Lean, Python and JavaScript code is Apache-2.0. Third-party materials retain their own licenses.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-03
DOI
https://doi.org/10.5281/zenodo.23122339
Citations
2
Primary Topic
Computational Geometry and Mesh Generation
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

A ten-pair covering theorem for two-intersecting six-uniform families

Yiming Liu
2 citations
Zenodo (CERN European Organization for Nuclear Research)
Computational Geometry and Mesh Generation
preprint

A ten-pair covering theorem for two-intersecting six-uniform families

Yiming Liu
preprint en
2 citations

Abstract

A pair cover of a family of sets is a collection of two-element sets such that each member of the family contains a whole selected pair. We prove that every two-intersecting family of six-element sets, on an arbitrary ground set, has a cover by at most ten pairs. The general upper bound of Aharoni and Zerbib gives fourteen in this case; the new bound, together with the classical eight-pair lower example, yields 8 ≤ g₁(6,2) ≤ 10. The proof successively excludes high intersections, high triple degree and pair degrees six, five and four. Complete physical supports and an isolated three-tail analysis then give uniqueness of exact two-point traces. A final incidence count and grouping of actual members assemble the cover. A compactness argument supplies one finite cover of a possibly infinite family. This independent preprint includes the manuscript, a detailed proof supplement with 424 source-located finite proof entries, the complete pinned Lean source project, mathematical certificates, frozen checker inputs and reproduction programs. Saved Lean build, axiom and dependency evidence is included; no new Lean compilation was performed for this preprint release. Default Windows integer and source checks passed; the reproduction commands and scope are documented in README.txt. The exact six-uniform pair-cover value remains undetermined. The companion five-uniform preprint determines g₁(5,2)=6. The articles share definitions, elementary covering tools and a verification framework. This six-uniform main theorem does not assume the five-uniform exact-value theorem; this record contains all source dependencies needed for its own reproduction. OpenAI’s ChatGPT was used primarily for translation, assistance with the Lean 4 formalization, and revisions to the manuscript wording. The author is responsible for checking all mathematical and formal details and takes responsibility for the final manuscript and formalization. License scope: manuscript and original mathematical certificate data are CC BY 4.0; original Lean, Python and JavaScript code is Apache-2.0. Third-party materials retain their own licenses.

Zenodo (CERN European Organization for Nuclear Research)
University of South China (CN)
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.