$r$-cross $t$-intersecting families via necessary intersection points
Pranshu Gupta, Yannick Mogge, Sim\'on Piga, Bjarne Sch\"ulke

TL;DR
This paper generalizes the Hilton-Milner theorem to $r$-cross $t$-intersecting families, determining maximum sizes and measures for uniform and non-uniform families, extending previous partial results.
Contribution
It provides a comprehensive generalization of the Hilton-Milner theorem for $r$-cross $t$-intersecting families, including uniform and arbitrary families, with measure-based results.
Findings
Determined maximum sum of sizes for $r$-cross $t$-intersecting families.
Extended results to families with mixed uniformities.
Unified measure-based framework for these families.
Abstract
Given integers and we call families -cross -intersecting if for all , , we have . We obtain a strong generalisation of the classic Hilton-Milner theorem on cross intersecting families. In particular, we determine the maximum of for -cross -intersecting families in the cases when these are -uniform families or arbitrary subfamilies of . Only some special cases of these results had been proved before. We obtain the aforementioned theorems as instances of a more general result that considers measures of -cross -intersecting families. This also provides the maximum of for families of possibly mixed uniformities…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Finite Group Theory Research · graph theory and CDMA systems
