Yongxin Lan

activity

20172026

most citedPlanar anti-Ramsey numbers for paths and cycles

5 citations · 19 across the 14 of their papers we have counts for

collaborators

Showing 2018Show all

4 papers · 1 filter

math.CO2018★ 3 cited

Extremal $H$ -free planar graphs

Yongxin Lan, Yongtang Shi, Zi-Xia Song

Given a graph $H$ , a graph is $H$ -free if it does not contain $H$ as a subgraph. We continue to study the topic of "extremal" planar graphs, that is, how many edges can an $H$ -free…

math.CO2018★ 1 cited

Planar anti-Ramsey numbers of matchings

Gang Chen, Yongxin Lan, Zi-Xia Song

Given a positive integer $n$ and a planar graph $H$ , let $T_{n} (H)$ be the family of all plane triangulations $T$ on $n$ vertices such that $T$ contains a subgraph isomorph…

math.CO2018★ 1 cited

Improved bounds for rainbow numbers of matchings in plane triangulations

Zhongmei Qin, Yongxin Lan, Yongtang Shi

Given two graphs $G$ and $H$ , the {\it rainbow number} $r b (G, H)$ for $H$ with respect to $G$ is defined as the minimum number $k$ such that any $k$ -edge-coloring of $G$ contains a…

math.CO2018

Degree powers in graphs with a forbidden forest

Yongxin Lan, Henry Liu, Zhongmei Qin +1

Given a positive integer $p$ and a graph $G$ with degree sequence $d_{1}, \dots, d_{n}$ , we define $e_{p} (G) = \sum_{i = 1}^{n} d_{i}^{p}$ . Caro and Yuster introduced a Turán-type problem for $e_p(G…

Extremal H-free planar graphs

Planar anti-Ramsey numbers of matchings

Improved bounds for rainbow numbers of matchings in plane triangulations

Degree powers in graphs with a forbidden forest

Extremal $H$ -free planar graphs