- Peking UniversityCN815 papers
- Tsinghua UniversityCN769 papers
- University of Science and Technology of ChinaCN768 papers
- Shandong UniversityCN712 papers
- Institute of High Energy PhysicsCN685 papers
- Sichuan UniversityCN661 papers
- China Center of Advanced Science and TechnologyCN658 papers
- Zhejiang UniversityCN658 papers
- Nanjing UniversityCN645 papers
- Wuhan UniversityCN631 papers
- University of Chinese Academy of SciencesCN630 papers
- Shanghai Jiao Tong UniversityCN624 papers
18 papers · 2 filters
On flushed partitions and concave compositions
Xiaochuan Liu
In this work, we give combinatorial proofs for generating functions of two problems, i.e., flushed partitions and concave compositions of even length. We also give combinatorial in…
Oriented diameter and rainbow connection number of a graph
Xiaolong Huang, Hengzhe Li, Xueliang Li +1
The oriented diameter of a bridgeless graph is . A path in an edge-colored graph , where adjacent edges may have the same co…
On the generalized (edge-)connectivity of graphs
Xueliang Li, Yaping Mao, Yuefang Sun
The generalized -connectivity of a graph was introduced by Chartrand et al. in 1984. It is natural to introduce the concept of generalized -edge-connectivity $λ_…
Euler's Partition Theorem with Upper Bounds on Multiplicities
William Y. C. Chen, Ae Ja Yee, Albert J. W. Zhu
We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts s…
Partially Ordinal Sums and -partitions
Daniel K. Du, Qing-Hu Hou
We present a method of computing the generating function $f_P(\x)$ of -partitions of a poset . The idea is to introduce two kinds of transformations on posets and compute $f_…
Rainbow connection number of dense graphs
Xueliang Li, Mengmeng Liu, Ingo Schiermeyer
An edge-colored graph is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph …