8 citations · 52 across the 81 of their papers we have counts for
5 papers · 1 filter
-polynomial weakly distance-regular digraphs
Qing Zeng, Yuefeng Yang, Kaishun Wang
A weakly distance-regular digraph is -polynomial if its attached scheme is -polynomial. In this paper, we characterize all -polynomial weakly distance-regular digraphs.
Some intersection theorems for finite sets
Mengyu Cao, Mei Lu, Benjian Lv +1
Let , , and be positive integers with , and a family of -subsets of an -set . The families $\mathcal…
Cross -intersecting families for symplectic polar spaces
Tian Yao, Kaishun Wang
Let be a symplectic polar space over a finite field , and denote the collection of all -dimensional totally isotropic subspace in $\m…
Cross -intersecting families for finite affine spaces
Tian Yao, Kaishun Wang
Denote the collection of all -flats in by . Let and sati…
-cross -intersecting families for vector spaces
Mengyu Cao, Mei Lu, Benjian Lv +1
Let be an -dimensional vector space over the finite field , and denote the family of all -dimensional subspaces of . The families $\mathcal…