Li-Ping Zhang

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

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

Menghan Ma, Qinghai Liu, Liping Zhang +1

Motivated by Mader's conjecture on connectivity keeping trees, we study the corresponding problem in triangle-free graphs. For positive integers $k, m$ , we first prove that every $k…

math.CO2026

Graph and Hypergraph Counterexamples to Mubayi's supersaturation Conjecture Beyond $n^{k - 1}$

Liping Zhang, Qinghai Liu, Qinfei Tang +1

For a fixed $k$ -graph $F$ , let $h_{F} (n, q)$ be the minimum number of copies of $F$ in an $n$ -vertex $k$ -graph with $ex (n, F) + q$ edges. Let $c (n, F)$ be the minimum number create…

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 triangle-free graphs

Graph and Hypergraph Counterexamples to Mubayi's supersaturation Conjecture Beyond nk−1

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 triangle-free graphs

Graph and Hypergraph Counterexamples to Mubayi's supersaturation Conjecture Beyond $n^{k - 1}$

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