$s$-almost cross-$t$-intersecting families for finite sets
Dehai Liu, Kaishun Wang, Tian Yao

TL;DR
This paper characterizes the largest possible product of sizes for $s$-almost cross-$t$-intersecting families of $k$-subsets, extending understanding of near-intersecting set families with stability results.
Contribution
It introduces a characterization of maximum-sized $s$-almost cross-$t$-intersecting families and establishes stability results for near-intersecting families.
Findings
Maximum product of sizes characterized
Stability results for near-intersecting families established
Extension of intersecting family theory to $s$-almost cases
Abstract
Two families and of -subsets of an -set are called -almost cross--intersecting if each member in (resp. ) is -disjoint with at most members in (resp. ). In this paper, we characterize the -almost cross--intersecting families with the maximum product of their sizes. Furthermore, we provide a corresponding stability result after studying the -almost cross--intersecting families which are not cross--intersecting.
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 · graph theory and CDMA systems · Advanced Graph Theory Research
