Saved in:
Bibliographic Details
Main Authors: Ai, Jiangdong, Chen, Ming, Kim, Seokbeom, Lee, Hyunwoo
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2601.20516
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918311111950336
author Ai, Jiangdong
Chen, Ming
Kim, Seokbeom
Lee, Hyunwoo
author_facet Ai, Jiangdong
Chen, Ming
Kim, Seokbeom
Lee, Hyunwoo
contents We prove that if two families $\mathcal{F} \subseteq \binom{[n]}{k}$ and $\mathcal{F}' \subseteq \binom{[n]}{k'}$ satisfy $\sum_{1 \leq i, j \leq \ell} \lvert F_i \cap F_j' \rvert \geq \ell^2t - \ell +1$ for every choice of distinct $F_1, \ldots, F_\ell \in \mathcal{F}$ and $F_1', \ldots, F_\ell' \in \mathcal{F}'$, then $\lvert \mathcal{F} \rvert \cdot \lvert \mathcal{F}' \rvert \leq \binom{n-t}{k-t} \binom{n-t}{k'-t}$, provided that $n$ is sufficiently large. This extends a celebrated theorem of Pyber for large $n$, which determines the tight upper bound for the product of the sizes of cross $1$-intersecting families.
format Preprint
id arxiv_https___arxiv_org_abs_2601_20516
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle On a weaker notion of cross $t$-intersecting families
Ai, Jiangdong
Chen, Ming
Kim, Seokbeom
Lee, Hyunwoo
Combinatorics
We prove that if two families $\mathcal{F} \subseteq \binom{[n]}{k}$ and $\mathcal{F}' \subseteq \binom{[n]}{k'}$ satisfy $\sum_{1 \leq i, j \leq \ell} \lvert F_i \cap F_j' \rvert \geq \ell^2t - \ell +1$ for every choice of distinct $F_1, \ldots, F_\ell \in \mathcal{F}$ and $F_1', \ldots, F_\ell' \in \mathcal{F}'$, then $\lvert \mathcal{F} \rvert \cdot \lvert \mathcal{F}' \rvert \leq \binom{n-t}{k-t} \binom{n-t}{k'-t}$, provided that $n$ is sufficiently large. This extends a celebrated theorem of Pyber for large $n$, which determines the tight upper bound for the product of the sizes of cross $1$-intersecting families.
title On a weaker notion of cross $t$-intersecting families
topic Combinatorics
url https://arxiv.org/abs/2601.20516