$s$-almost $t$-intersecting families for vector spaces
Combinatorics
2024-12-18 v3
Abstract
Let be a finite dimensional vector space over a finite field, and a family consisting of -subspaces of . The family is called -intersecting if for any . We say is -almost -intersecting if for each there are at most members of such that . In this paper, we prove that -almost -intersecting families with maximum size are -intersecting. We also consider -almost -intersecting families which are not -intersecting, and characterize such families with maximum size for . The result for -almost -intersecting families provided by Shan and Zhou is generalized.
Keywords
Cite
@article{arxiv.2406.05840,
title = {$s$-almost $t$-intersecting families for vector spaces},
author = {Lijun Ji and Dehai Liu and Kaishun Wang and Tian Yao and Shuhui Yu},
journal= {arXiv preprint arXiv:2406.05840},
year = {2024}
}