Skip to content
DraconiticResearch
Search Sources API
186,546 studies31 sourcesUpdated 52 min ago
PreprintarXiv licencearXiv

A Sharp Product Bound for Disjoint Cross-Intersecting 3-Graphs with Covering Number Three

  • Arthur F. Ramos
  • David B. Hulak
  • Ruy J. G. B. de Queiroz
Open at sourcePDFDOICite

Abstract

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.

Related

  1. The maximum size of intersecting k-graphs with covering number k
    Peter Frankl, Jian Wang, Yaoran Yang +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. Large Maximal Intersecting Families with Covering Number Three
    Huajun Zhang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Intersecting families with large covering number - On a conjecture of Frankl, Ota, and Tokushige
    Balázs Patkós
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. Local Antimagic Chromatic Number of Middle Graph and Direct Product of Graphs
    Huimin Xu, Gee-Choon Lau, Ruixue Zhang
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. A product inequality and its application to cross-intersecting families
    Toshihiro Shimizu, Norihide Tokushige
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{ramos2026sharp,
  title = {{A Sharp Product Bound for Disjoint Cross-Intersecting 3-Graphs with Covering Number Three}},
  author = {Arthur F. Ramos and David B. Hulak and Ruy J. G. B. de Queiroz},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.26206},
  eprint = {2609.26206},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.26206},
}
RIS
TY  - UNPB
TI  - A Sharp Product Bound for Disjoint Cross-Intersecting 3-Graphs with Covering Number Three
AU  - Arthur F. Ramos
AU  - David B. Hulak
AU  - Ruy J. G. B. de Queiroz
PY  - 2026
DA  - 2026/09/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.26206
UR  - https://arxiv.org/abs/2609.26206
AB  - 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.
ER  -