1.5k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Nankai UniversityCN185 papers
- Chinese Academy of SciencesCN114 papers
- National University of SingaporeSG63 papers
- Tsinghua UniversityCN53 papers
- University of Chinese Academy of SciencesCN50 papers
- Peking UniversityCN48 papers
- Nanyang Technological UniversitySG43 papers
- Centre National de la Recherche ScientifiqueFR39 papers
- University of Science and Technology of ChinaCN37 papers
- Peng Huanwu Center for Fundamental TheoryCN31 papers
- Beijing Normal UniversityCN29 papers
- Lanzhou UniversityCN29 papers
4 papers · 2 filters
Polynomial Reduction and Super Congruences
Qing-Hu Hou, Yan-Ping Mu, Doron Zeilberger
Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in shor…
Upper bounds for bar visibility of subgraphs and n-vertex graphs
Yuanrui Feng, Douglas B. West, Yan Yang
A -bar visibility representation of a graph assigns each vertex up to horizontal bars in the plane so that two vertices are adjacent if and only if some bar for one vertex c…
Exact bipartite Turán numbers of large even cycles
Binlong Li, Bo Ning
Let the bipartite Turán number of a graph be the maximum number of edges in an -free bipartite graph with two parts of sizes and , respectively. In this p…
The thickness of the Kronecker product of graphs
Xia Guo, Yan Yang
The thickness of a graph is the minimum number of planar subgraphs whose union is . In this paper, we present sharp lower and upper bounds for the thickness of the Kronecker…