collaborators

5 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

Graph and Hypergraph Counterexamples to Mubayi's supersaturation Conjecture Beyond

Liping Zhang, Qinghai Liu, Qinfei Tang +1

For a fixed -graph , let be the minimum number of copies of in an -vertex -graph with edges. Let be the minimum number create…

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…