Li-Ping Zhang

collaborators

2 papers

math.CO2026

Connectivity keeping pendant extensions of paths in $k$ -connected graphs and triangle-free graphs

Menghan Ma, Qinghai Liu, Liping Zhang +1

Motivated by Mader's conjecture on connectivity keeping trees, we study trees obtained from paths by adding one pendant vertex, as well as related problems in triangle-free graphs.…

math.CO2026

The Bounded-VC chromatic thresholds of graphs

Jinze Hu, Qinghai Liu, Liping Zhang +1

For a graph $H$ , the chromatic threshold $δ_{χ} (H)$ is the infimum of $c > 0$ such that the chromatic number of every $n$ -vertex $H$ -free graph with minimum degree at least $c n$ is bou…

Connectivity keeping pendant extensions of paths in k-connected graphs and triangle-free graphs

The Bounded-VC chromatic thresholds of graphs

Connectivity keeping pendant extensions of paths in $k$ -connected graphs and triangle-free graphs