arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.04867math.CO
收藏

一个910块显式构造,保证与每个[60]的6元子集三交

A 910-block explicit construction guaranteeing a triple intersection with every $6$-subset of $[60]$

School of Technology (FT), University of Campinas (Unicamp)(坎皮纳斯大学技术学院)

Paulo Henrique Cunha Gomes

AI总结:

该研究提出一个显式构造,通过组合方法生成910个6元子集,确保每个6元子集与至少一个子集有三个共同元素,解决了覆盖半径为3的Johnson图覆盖问题。

摘要:

我们提出一个简单的显式族\mathcal{B},由910个[60]={1,…,60}的6元子集组成,使得每个6元子集S⊂[60]至少与一个块B∈\mathcal{B}在至少三个元素上相交,即|S∩B|≥3。等价地,\mathcal{B}是Johnson图J(60,6)的覆盖(支配集),其覆盖半径为3的Johnson度量。该构造纯属组合学,基于将[60]固定分成两半,对每半进行配对,并应用鸽巢原理。我们还记录了一个粗略的计数下界以及一个直接推广到[2m](m为偶数)的简单方法。

英文摘要:

We present a simple explicit family $\mathcal{B}$ of $910$ $6$-subsets of $[60]=\{1,\dots,60\}$ such that every $6$-subset $S\subset[60]$ intersects at least one block $B\in\mathcal{B}$ in at least three elements, i.e.\ $|S\cap B|\ge 3$. Equivalently, $\mathcal{B}$ is a covering (dominating set) of the Johnson graph $J(60,6)$ with covering radius $3$ in the Johnson metric. The construction is purely combinatorial, based on a fixed split of $[60]$ into two halves, a pairing of each half, and a pigeonhole argument. We also record a crude counting lower bound and a straightforward generalization to $[2m]$ (with $m$ even).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑