Metraipolis › archive › dc_f092a37d2987
A Sharp Product Bound for Disjoint Cross-Intersecting 3-Graphs with Covering Number Three — arXiv:2609.26206
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.26206
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T15:56:01.327Z
- SHA-256 of the archived text
4f00ef290fe97a9d3ccb01b3456f16e9f5d7f5f316554dbf620d4674226c9c91- Stable URL of this page
https://metraipolis.com/documento/dc_f092a37d2987
How to cite
A Sharp Product Bound for Disjoint Cross-Intersecting 3-Graphs with Covering Number Three — arXiv:2609.26206 — arXiv (en), https://arxiv.org/abs/2609.26206 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f092a37d2987 (Metraipolis archive dc_f092a37d2987, sha256 4f00ef290fe97a9d3ccb01b3456f16e9f5d7f5f316554dbf620d4674226c9c91)
BibTeX
@misc{dcf092a37d2987,
title = {A Sharp Product Bound for Disjoint Cross-Intersecting 3-Graphs with Covering Number Three — arXiv:2609.26206},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.26206},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f092a37d2987; sha256 4f00ef290fe97a9d3ccb01b3456f16e9f5d7f5f316554dbf620d4674226c9c91},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.26206. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Lin, Frankl, and Wu proved that the product of the sizes of two cross-intersecting 3-uniform hypergraphs with covering number three is at most 121. They conjectured that requiring the families to be disjoint lowers the sharp bound to 100. We prove this conjecture. The smaller family has at most eleven edges; after fixing it, the other family may be enlarged to its external family of 3-transversals. Splitting by matching number leaves an elementary intersecting case and two finite kernels. We prove the correctness of both encodings and every pruning rule, and exhaustive C++20 computations give the external-blocker maxima 21, 19, 16, 14, 12, 11, 10, 9 for family sizes 4 through 11. Concrete witnesses are checked independently in Python. A pair of ten-edge families on six vertices attains product 100. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.26206 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T15:16:21.692Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).