Ping Li

activity

20232025

collaborators

Showing 2025Show all

3 papers · 1 filter

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…

math.CO2025

On $F$ -multicolor Turán number of hypergraph graphs

Ping Li

The Ruzsa-Szemerédi $(6, 3)$ -problem can be equivalently stated as determining the maximum number of edge-disjoint triangles on $n$ vertices such that no triangle is formed by edges…

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

The maximum number of cliques in disjoint copies of graphs

On F-multicolor Turán number of hypergraph graphs

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

On $F$ -multicolor Turán number of hypergraph graphs