中文

Hilton-Milner定理的乘积形式II

组合数学 2026-05-12 v1

摘要

两个F,G\mathcal{F}, \mathcal{G}kk子集组成的家族若满足对所有FF,GGF\in \mathcal{F}, G\in \mathcal{G}都有FGF\cap G\neq \emptyset,且{F ⁣:FF}=={G ⁣:GG}\cap \{F\colon F\in \mathcal{F}\}=\emptyset=\cap \{G\colon G\in\mathcal{G}\},则称为非平凡交叉相交。本文在k8k\geq 8的完整范围内建立了Hilton-Milner定理的乘积形式。即若F,G([n]k)\mathcal{F}, \mathcal{G}\subset \binom{[n]}{k}为非平凡交叉相交,且n2k+1n\geq 2k+1k8k\geq 8,则[FG((n1k1)(nk1k1)+1)2|\mathcal{F}||\mathcal{G}|\leq \left(\binom{n-1}{k-1}- \binom{n-k-1}{k-1} +1\right)^2

关键词

引用

@article{arxiv.2605.09246,
  title  = {A product version of the Hilton-Milner Theorem II},
  author = {Peter Frankl and Jian Wang},
  journal= {arXiv preprint arXiv:2605.09246},
  year   = {2026}
}