8 citations · 52 across the 81 of their papers we have counts for
5 papers · 1 filter
-almost -intersecting families for finite sets
Dehai Liu, Kaishun Wang, Tian Yao
A family of -subsets of an -set is called -almost -intersecting if each member is -disjoint with at most members. In this paper, we prove that, if…
A Bollobáss-type theorem on singular linear spaces
Erfei Yue, Benjian Lv, Péter Sziklai +1
Bollobás-type theorem determines the maximum cardinality of a Bollobás system of sets. The original result has been extended to various mathematical structures beyond sets, includi…
Weakly distance-regular digraphs whose underlying graphs are distance-regular,II
Qing Zeng, Yuefeng Yang, Kaishun Wang
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [16], we classified all commutative weakly distance-regular digraphs whose underlying…
-almost -intersecting families for vector spaces
Lijun Ji, Dehai Liu, Kaishun Wang +2
Let be a finite dimensional vector space over a finite field, and a family consisting of -subspaces of . The family is called -intersecting…
Locally semicomplete weakly distance-regular digraphs
Yuefeng Yang, Shuang Li, Kaishun Wang
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood (resp. in-neighbourhood) of any vertex induces…