66 citations · 268 across the 69 of their papers we have counts for
5 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…
Extremal -free planar graphs
Yongxin Lan, Yongtang Shi, Zi-Xia Song
Given a graph , a graph is -free if it does not contain as a subgraph. We continue to study the topic of "extremal" planar graphs, that is, how many edges can an -free…
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…
Improved bounds for rainbow numbers of matchings in plane triangulations
Zhongmei Qin, Yongxin Lan, Yongtang Shi
Given two graphs and , the {\it rainbow number} for with respect to is defined as the minimum number such that any -edge-coloring of contains a…
Degree powers in graphs with a forbidden forest
Yongxin Lan, Henry Liu, Zhongmei Qin +1
Given a positive integer and a graph with degree sequence , we define . Caro and Yuster introduced a Turán-type problem for $e_p(G…