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
11 papers · 2 filters
A path Turan problem for infinite graphs
Xing Peng, Craig Timmons
Let be an infinite graph whose vertex set is the set of positive integers, and let be the subgraph of induced by the vertices . An increasing pat…
Congruences on the Number of Restricted -ary Partitions
Qing-Hu Hou, Hai-Tao Jin, Yan-Ping Mu +1
Andrews, Brietzke, Rødseth and Sellers proved an infinite family of congruences on the number of the restricted -ary partitions when is a prime. In this note, we show that t…
Coloring graphs with two odd cycle lengths
Jie Ma, Bo Ning
In this paper we determine the chromatic number of graphs with two odd cycle lengths. Let be a graph and be the set of all odd cycle lengths of . We prove that: (1) I…
On the decomposition of random hypergraphs
Xing Peng
For an -uniform hypergraph , let be the minimum number of complete -partite -uniform subhypergraphs of whose edge sets partition the edge set of . For a g…
Automated Discovery and Proof of Congruence Theorems for Partial Sums of Combinatorial Sequences
William Y. C. Chen, Qing-Hu Hou, Doron Zeilberger
Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of , for some Laurent polynomials and i…
Infinite Orders and Non--finite Property of -Dimensional Lattice Walks
Daniel K. Du, Qing-Hu Hou, Rong-Hua Wang
Recently, Bostan and his coauthors investigated lattice walks restricted to the non-negative octant . For the non-trivial models with at most six steps, they…
Degree conditions restricted to induced paths for hamiltonicity of claw-heavy graphs
Binlong Li, Bo Ning, Shenggui Zhang
Broersma and Veldman proved that every 2-connected claw-free and -free graph is hamiltonian. Chen et al. extended this result by proving every 2-connected claw-heavy and …
Heavy subgraphs, stability and hamiltonicity
Binlong Li, Bo Ning
Let be a graph. Adopting the terminology of Broersma et al. and Čada, respectively, we say that is 2-heavy if every induced claw () of contains two end-vertice…
Sun's log-concavity conjecture on the Catalan-Larcombe-French sequence
James J. Y. Zhao
Let denote the Catalan-Larcombe-French sequence, which naturally came up from the series expansion of the complete elliptic integral of the first kind. In this…
Extremal problems on the Hamiltonicity of claw-free graphs
Binlong Li, Bo Ning, Xing Peng
In 1962, Erdős proved that if a graph with vertices satisfies $$ e(G)>\max\left\{\binom{n-k}{2}+k^2,\binom{\lceil(n+1)/2\rceil}{2}+\left\lfloor \frac{n-1}{2}\right\rfloor^2…
Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
Binlong Li, Bo Ning
In 1962, Erdős gave a sufficient condition for Hamilton cycles in terms of the vertex number, edge number, and minimum degree of graphs which generalized Ore's theorem. One year la…