s-almost cross-t-intersecting families for finite sets
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:SQWYKJPPrecord.jsonopen to challenge →
read the original abstract
Two families $\mathcal{F}$ and $\mathcal{G}$ of $k$-subsets of an $n$-set are called $s$-almost cross-$t$-intersecting if each member in $\mathcal{F}$ (resp. $\mathcal{G}$) is $t$-disjoint with at most $s$ members in $\mathcal{G}$ (resp. $\mathcal{F}$). In this paper, we characterize the $s$-almost cross-$t$-intersecting families with the maximum product of their sizes. Furthermore, we provide a corresponding stability result after studying the $s$-almost cross-$t$-intersecting families which are not cross-$t$-intersecting.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.