Two families are cross-intersecting if for all and , and non-trivial if neither nor is a star. Pyber proved that any two cross-intersecting families satisfy , and the maximum is attained by two full stars. Frankl, as well as Frankl and Wang, conjectured that the sharp bound, when both families are required to be non-trivial, is , where , the size of the Hilton–Milner family. The cases , and the range and , were established earlier by Frankl and by Frankl and Wang, respectively. In this paper, we prove their conjecture in the full range. We show that every non-trivial cross-intersecting pair with and satisfies . Moreover, we characterize all extremal pairs. Whereas the corresponding sum problem admits asymmetric and unbalanced extremizers, the product extremum forces a balanced, symmetric-or-dual structure: the two families are isomorphic when and complement-dual when . Independently and contemporaneously with the present work, Frankl and Wang obtained the same bound for and by a different method. Our proof combines a diversity technique with several new properties of an extended shift operation. Moreover, we show that the problem behaves differently for different uniformities, exhibiting new extremal configurations. In particular, we disprove a related conjecture proposed by Frankl and Wang.

生成讲解博客的中文版本

生成AI智能校验的中文版本