2000 character limit reached
$s$-almost cross-$t$-intersecting families for finite sets
Published 27 Jun 2025 in math.CO | (2506.21993v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.