arXiv Analytics

Sign in

arXiv:2104.13089 [math.CO]AbstractReferencesReviewsResources

Large non-trivial $t$-intersecting families for signed sets

Tian Yao, Benjian Lv, Kaishun Wang

Published 2021-04-27Version 1

For positive integers $n,r,k$ with $n\ge r$ and $k\ge2$, a set $\{(x_1,y_1),(x_2,y_2),\dots,(x_r,y_r)\}$ is called a $k$-signed $r$-set on $[n]$ if $x_1,\dots,x_r$ are distinct elements of $[n]$ and $y_1\dots,y_r\in[k]$. We say a $t$-intersecting family consisting of $k$-signed $r$-sets on $[n]$ is trivial if each member of this family contains a fixed $k$-signed $t$-set. In this paper, we determine the structure of large maximal non-trivial $t$-intersecting families. In particular, we characterize the non-trivial $t$-intersecting families with maximum size for $t\ge2$, extending a Hilton-Milner-type result for signed sets given by Borg.

Related articles: Most relevant | Search more
arXiv:2103.11117 [math.CO] (Published 2021-03-20)
Non-trivial $t$-intersecting families for the distance-regular graphs of bilinear forms
arXiv:math/0306119 [math.CO] (Published 2003-06-06)
The number of k-intersections of an intersecting family of r-sets
arXiv:2407.12289 [math.CO] (Published 2024-07-17)
On intersecting families of subgraphs of perfect matchings