English

$s$-almost $t$-intersecting families for vector spaces

Combinatorics 2024-12-19 v2

Abstract

Let F\mathcal{F} be a family of kk-dimensional subspaces of an nn-dimensional vector space. Write DF(H;t)={FF ⁣:dim(FH)t}\mathcal{D}_{\mathcal{F}}(H;t)=\{F\in \mathcal{F}\colon \dim(F\cap H)\leq t \} for a subspace HH. The family F\mathcal{F} is called ss-almost tt-intersecting if DF(F;t)s|\mathcal{D}_{\mathcal{F}}(F;t)|\leq s for each FFF\in \mathcal{F}. In this note, we prove that ss-almost tt-intersecting families with maximum size are tt-intersecting.

Keywords

Cite

@article{arxiv.2412.08659,
  title  = {$s$-almost $t$-intersecting families for vector spaces},
  author = {Shuhui Yu and Lijun Ji},
  journal= {arXiv preprint arXiv:2412.08659},
  year   = {2024}
}

Comments

This manuscript has been improved joint with Dehai Liu, Kaishun Wang and Tian Yao; see arXiv:2406.05840v3

R2 v1 2026-06-28T20:31:27.704Z