Ping Li

collaborators

3 papers

math.CO2025

Planar Turán number of disjoint union of $C_{3}$ and $C_{5}$

Luyi Li, Ping Li, Guiying Yan +1

The planar Turán number of $H$ , denoted by $e x_{P} (n, H)$ , is the maximum number of edges in an $n$ -vertex $H$ -free planar graph. The planar Turán number of $k \geq 3$ vert…

math.CO2025

The maximum number of cliques in disjoint copies of graphs

Zhipeng Gao, Ping Li, Changhong Lu +2

The problem of determining the maximum number of copies of $T$ in an $H$ -free graph, for any graphs $T$ and $H$ , was considered by Alon and Shikhelman. This is a variant of Turán's…

cs.DM2024

Conflict-free chromatic index of trees

Shanshan Guo, Ethan Y. H. Li, Luyi Li +1

A graph $G$ is conflict-free $k$ -edge-colorable if there exists an assignment of $k$ colors to $E (G)$ such that for every edge $e \in E (G)$ , there is a color that is assigned to exa…

Planar Turán number of disjoint union of C3​ and C5​

The maximum number of cliques in disjoint copies of graphs

Conflict-free chromatic index of trees

Planar Turán number of disjoint union of $C_{3}$ and $C_{5}$