1 citations · 1 across the 17 of their papers we have counts for
5 papers · 1 filter
Sublinear Edge Fault-Tolerant Hyperspanners for Hypergraphs
Jialin He, Nicholas Popescu, Chunjiang Zhu
In this paper, we initiate the study on fault-tolerant (FT) graph spanners for hypergraphs and show the generalization to hypergraphs in the FT setting is non-trivial. An FT spanne…
On the number of triangles in -free graphs
Jialin He, Jie Ma, Yan Wang +1
Erdős asked whether for any -vertex graph , the parameter is at most , where the minimum is taken over all edge…
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…
On the -clique cover number of graphs
Yihan Chen, Jialin He, Tianying Xie
In 1966, Erdős, Goodman, and Pósa proved that cliques are sufficient to cover all edges in any -vertex graph, with tightness achieved by the balanced com…
Extracting the kinetic freeze-out properties of high energy pp collisions at the LHC with event shape classifiers
Jialin He, Xinye Peng, Zhongbao Yin +1
Event shape measurements are crucial for understanding the underlying event and multiple-parton interactions (MPIs) in high energy proton-proton (pp) collisions. In this paper, the…