arXiv Analytics

Sign in

arXiv:2103.11117 [math.CO]AbstractReferencesReviewsResources

Non-trivial $t$-intersecting families for the distance-regular graphs of bilinear forms

Mengyu Cao, Benjian Lv, Kaishun Wang

Published 2021-03-20Version 1

Let $V$ be an $(n+\ell)$-dimensional vector space over a finite field, and $W$ a fixed $\ell$-dimensional subspace of $V$. Write ${V\brack n,0}$ to be the set of all $n$-dimensional subspaces $U$ of $V$ satisfying $\dim(U\cap W)=0$. A family $\mathcal{F}\subseteq{V\brack n,0}$ is $t$-intersecting if $\dim(A\cap B)\geq t$ for all $A,B\in\mathcal{F}$. A $t$-intersecting family $\mathcal{F}\subseteq{V\brack n,0}$ is called non-trivial if $\dim(\cap_{F\in\mathcal{F}}F)<t$. In this paper, we describe the structure of non-trivial $t$-intersecting families of ${V\brack n,0}$ with large size. In particular, we show the structure of the non-trivial $t$-intersecting families with maximum size, which extends the Hilton-Milner Theorem for ${V\brack n,0}$.

Related articles: Most relevant | Search more
arXiv:1610.03027 [math.CO] (Published 2016-10-10)
On the union of intersecting families
arXiv:2104.13089 [math.CO] (Published 2021-04-27)
Large non-trivial $t$-intersecting families for signed sets
arXiv:2101.01757 [math.CO] (Published 2021-01-05)
A preliminary result for generalized intersecting families