output
20022014
most citedObservation of electron-antineutrino disappearance at Daya Bay

2.2k citations

Showing 2011 · math.COShow all

5 papers · 2 filters

math.CO2011

Combinatorial Telescoping for an Identity of Andrews on Parity in Partitions

William Y. C. Chen, Daniel K. Du, Charles B. Mei

Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of…

math.CO2011

Oscillating Rim Hook Tableaux and Colored Matchings

William Y. C. Chen, Peter L. Guo

Motivated by the question of finding a type B analogue of the bijection between oscillating tableaux and matchings, we find a correspondence between oscillating m-rim hook tableaux…

math.CO2011

On Han's Hook Length Formulas for Trees

William Y. C. Chen, Oliver X. Q. Gao, Peter L. Guo

Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han's formulas has been generalized to k-ary trees by Yang. Sagan has fo…

math.CO201113 cited

Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph

Lily Chen, Xueliang Li, Mengmeng Liu

A vertex-colored graph is rainbow vertex-connected if any pair of distinct vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-con…

math.CO201119 cited

The generalized 3-connectivity of Cartesian product graphs

Hengzhe Li, Xueliang Li, Yuefang Sun

The generalized connectivity of a graph, which was introduced recently by Chartrand et al., is a generalization of the concept of vertex connectivity. Let be a nonempty set of…