Ping Li

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

Planar TurÃ¡n numbers of three configurations

Xuqing Bai, Zhipeng Gao, Ping Li

The planar TuÃ¡n number of $H$ , denoted by $e x_{P} (n, H)$ , is defined as the maximum number of edges in an $n$ -vertex $H$ -free planar graph. The exact value of $ex_{\mathc…

math.CO2025

Dense $2$ -connected planar graphs and the planar TurÃ¡n number of $2 C_{k}$

Ping Li

Shi, Walsh and Yu demonstrated that any dense planar graph with certain property (known as circuit graph) contains a large near-triangulation. We extend the result to $2$ -connected…

Planar TurÃ¡n numbers of three configurations

Dense 2-connected planar graphs and the planar TurÃ¡n number of 2Ck​

Dense $2$ -connected planar graphs and the planar TurÃ¡n number of $2 C_{k}$