activity
20182026
most citedRooted Spider Embeddings and the Erd\H os-Sós Conjecture

2 citations · 2 across the 4 of their papers we have counts for

collaborators

7 papers

math.CO2026

Connectivity keeping pendant extensions of paths in -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 , we first prove that every $k…

math.CT2026

A categorical approach to the set-theoretic Yang-Baxter equation

A. L. Agore, A. Chirvasitu, G. Militaru

We investigate set-theoretic solutions of the Yang--Baxter equation from a categorical perspective. The paper has two main objectives. On the one hand, several existing constructio…

math.CO2026

Complete counterexamples to Mubayi's supersaturation conjecture for graphs

Liping Zhang, Qinghai Liu

For a graph , its extremal number and extremal graphs denote the maximum number of edges in -free graphs and the graphs attaining this maximum, respectively.…

math.CO2026

Connectivity keeping pendant extensions of paths in -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 , the chromatic threshold is the infimum of such that the chromatic number of every -vertex -free graph with minimum degree at least is bou…

math.CO2023

On the edge reconstruction of the characteristic and permanental polynomials of a simple graph

Jingyuan Zhang, Xian'an Jin, Weigen Yan +1

As a variant of the Ulam's vertex reconstruction conjecture and the Harary's edge reconstruction conjecture, Cvetković and Schwenk posed independently the following problem: Can th…

math.CO2018★ 2 cited

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Genghua Fan, Yanmei Hong, Qinghai Liu

Under a local density condition, we prove that every -edge spider embeds at any prescribed center of degree at least , unless all legs are even and the host graph has one of…