most citedAn Erdős-Ko-Rado theorem in general linear groups

2 citations · 3 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO20112 cited

An Erdős-Ko-Rado theorem in general linear groups

Jun Guo, Kaishun Wang

Let be the symmetric group on points. Deza and Frankl [M. Deza and P. Frankl, On the maximum number of permutations with given maximal or minimal distance, J. Combin. The…

math.CO2011

Suborbits of a point stabilizer in the orthogonal group on the last subconstituent of orthogonal dual polar graphs

Fenggao Li, Kaishun Wang, Jun guo +1

As one of the serial papers on suborbits of point stabilizers in classical groups on the last subconstituent of dual polar graphs, the corresponding problem for orthogonal dual pol…

math.CO20111 cited

t-singular linear spaces

Jun Guo, Kaishun Wang, Fenggao Li

As a generalization of singular linear spaces, we introduce the concept of t-singular linear spaces, make some anzahl formulas of subspaces, and determine the suborbits of t-singul…

math.CO2011

Pooling designs with surprisingly high degree of error correction in a finite vector space

Jun Guo, Kaishun Wang

Pooling designs are standard experimental tools in many biotechnical applications. It is well-known that all famous pooling designs are constructed from mathematical structures by…

math.CO2011

A construction of pooling designs with surprisingly high degree of error correction

Jun Guo, Kaishun Wang

It is well-known that many famous pooling designs are constructed from mathematical structures by the "containment matrix" method. In this paper, we propose another method and obta…

math.CO2011

Metric dimension of some distance-regular graphs

Jun Guo, Kaishun Wang, Fenggao Li

A resolving set of a graph is a set of vertices with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. In this paper, we…