1k citations
- Tsinghua UniversityCN56 papers
- Chinese Academy of SciencesCN53 papers
- University of Chinese Academy of SciencesCN31 papers
- Nanyang Technological UniversitySG27 papers
- Beijing Institute of TechnologyCN23 papers
- Beijing Normal UniversityCN21 papers
- Tianjin UniversityCN21 papers
- Peking UniversityCN18 papers
- University of Electronic Science and Technology of ChinaCN18 papers
- Peng Cheng LaboratoryCN16 papers
- University of Science and Technology of ChinaCN16 papers
- Beijing University of Posts and TelecommunicationsCN14 papers
13 papers · 2 filters
New bounds on the maximum size of Sperner partition systems
Yanxun Chang, Charles J. Colbourn, Adam Gowty +2
An -Sperner partition system is a collection of partitions of some -set, each into nonempty classes, such that no class of any partition is a subset of a class of any…
Antimagic orientations of disconnected even regular graphs
Chen Song, Rong-Xia Hao
A of a digraph with arcs is a bijection from the set of arcs of to . A labeling of is if no two vertices in have the sa…
Vertex-primitive s-arc-transitive digraphs of alternating and symmetric groups
Jiangmin Pan, Cixuan Wu, Fugang Yin
A fascinating problem on digraphs is the existence problem of the finiteupper bound on s for all vertex-primitive s-arc-transitive digraphs except directed cycles (which is known t…
Classical pattern distributions in and
Dun Qiu, Jeffrey Remmel
Classical pattern avoidance and occurrence are well studied in the symmetric group . In this paper, we provide explicit recurrence relations to the generating func…
Several classes of optimal Ferrers diagram rank-metric codes
Shuangqing Liu, Yanxun Chang, Tao Feng
Four constructions for Ferrers diagram rank-metric (FDRM) codes are presented. The first one makes use of a characterization on generator matrices of a class of systematic maximum…
The generalized connectivity of some regular graphs
Shu-Li Zhao, Rong-Xia Hao
The generalized -connectivity of a graph is a parameter that can measure the reliability of a network to connect any vertices in , which is proved to b…