5 citations · 19 across the 14 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
The Turan number of 2P_7
Yongxin Lan, Zhongmei Qin, Yongtang Shi
The Turán number of a graph , denoted by , is the maximum number of edges in any graph on vertices which does not contain as a subgraph. Let denote the…
math.CO2017★ 4 cited
Extremal Theta-free planar graphs
Yongxin Lan, Yongtang Shi, Zi-Xia Song
Given a family , a graph is -free if it does not contain any graph in as a subgraph. We study the topic of "extremal" planar graphs initiate…
math.CO2017★ 5 cited
Planar anti-Ramsey numbers for paths and cycles
Yongxin Lan, Yongtang Shi, Zi-Xia Song
Motivated by anti-Ramsey numbers introduced by Erdős, Simonovits and Sós in 1975, we study the anti-Ramsey problem when host graphs are plane triangulations. Given a positive integ…