23 citations · 56 across the 19 of their papers we have counts for
4 papers · 1 filter
Gallai-Ramsey numbers of and
Hui Lei, Yongtang Shi, Zi-Xia Song +1
A Gallai coloring is a coloring of the edges of a complete graph without rainbow triangles, and a Gallai -coloring is a Gallai coloring that uses colors. Given an integer $k…
On Hypergraph Lagrangians and Frankl-Füredi's Conjecture
Hui Lei, Linyuan Lu
Frankl and Füredi conjectured in 1989 that the maximum Lagrangian, denoted by , among all -uniform hypergraphs of fixed size is achieved by the minimum hypergraph $C…
On Lagrangians of -uniform hypergraphs
Hui Lei, Linyuan Lu, Yuejian Peng
Frankl and Füredi conjectured in 1989 that the maximum Lagrangian of all -uniform hypergraphs of fixed size is realized by the minimum hypergraph under the colexic…
k-Ary spanning trees contained in tournaments
Jiangdong Ai, Hui Lei, Yongtang Shi +2
A rooted tree is called a -ary tree, if all non-leaf vertices have exactly children, except possibly one non-leaf vertex has at most children. Denote by the min…