|国家预印本平台
首页|$s$-almost cross-$t$-intersecting families for finite sets

$s$-almost cross-$t$-intersecting families for finite sets

$s$-almost cross-$t$-intersecting families for finite sets

来源:Arxiv_logoArxiv
英文摘要

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.

Dehai Liu、Kaishun Wang、Tian Yao

数学

Dehai Liu,Kaishun Wang,Tian Yao.$s$-almost cross-$t$-intersecting families for finite sets[EB/OL].(2025-06-27)[2025-07-18].https://arxiv.org/abs/2506.21993.点此复制

评论