12 papers
On three open problems in zero-sum Ramsey numbers
Cheng Chi, Jialin He, Quan Sun
Let denote the -vertex complete -uniform hypergraph. For an -uniform hypergraph and an integer , the -color Ramsey number is the least…
A note on zero-sum Ramsey numbers of complete graphs
Cheng Chi, Jialin He, Fuhong Ma
For a graph with , the zero-sum Ramsey number is the least integer such that every labeling of the edges of by elements of contains a c…
On Zero-sum Ramsey numbers of complete bipartite graphs
Cheng Chi, Jialin He
For an integer and a graph satisfying , the zero-sum Ramsey number is the least integer such that every edge-labeling $w\colon E(K_n…
On zero-sum Ramsey numbers of cycles and wheels
Cheng Chi, Jialin He
For an integer and a graph with , let be the least integer such that every edge-labeling contains a copy of wh…
Sublinear Edge Fault Tolerant Spanners for Hypergraphs
Jialin He, Nicholas Popescu, Chunjiang Zhu
We initiate the study on fault-tolerant spanners in hypergraphs and develop fast algorithms for their constructions. A fault-tolerant (FT) spanner preserves approximate distances u…
Studies of beauty hadron and non-prompt charm hadron production in pp collisions at =13 TeV within a transport model approach
Jialin He, Xinye Peng, Xiaoming Zhang +1
In high-energy proton proton () collisions at the LHC, non-prompt charm hadrons, originating from beauty hadron decays, provide a valuable probe for beauty quark dynamics, part…