English

A Product Version of the Hilton-Milner-Frankl Theorem

Combinatorics 2022-11-16 v2

Abstract

Two families F,G\mathcal{F},\mathcal{G} of kk-subsets of {1,2,,n}\{1,2,\ldots,n\} are called non-trivial cross tt-intersecting if FGt|F\cap G|\geq t for all FF,GGF\in \mathcal{F}, G\in \mathcal{G} and {F ⁣:FF}<t|\cap \{F\colon F\in \mathcal{F}\}|<t, {G ⁣:GG}<t|\cap \{G\colon G\in\mathcal{G}\}|<t. In the present paper, we determine the maximum product of the sizes of two non-trivial cross tt-intersecting families of kk-subsets of {1,2,,n}\{1,2,\ldots,n\} for n4(t+2)2k2n\geq 4(t+2)^2k^2, k5k\geq 5, which is a product version of the Hilton-Milner-Frankl Theorem.

Keywords

Cite

@article{arxiv.2206.07217,
  title  = {A Product Version of the Hilton-Milner-Frankl Theorem},
  author = {Peter Frankl and Jian Wang},
  journal= {arXiv preprint arXiv:2206.07217},
  year   = {2022}
}

Comments

to appear in Science China Mathematics. arXiv admin note: text overlap with arXiv:2205.00109