Yanmei Hong

collaborators

2 papers

math.CO2021

Mader's conjecture for graphs with small connectivity

Yanmei Hong, Qinghai Liu

Mader conjectured that for any tree $T$ of order $m$ , every $k$ -connected graph $G$ with minimum degree at least $⌊ \frac{3 k}{2} ⌋ + m - 1$ contains a subtree $T^{'} ≅ T$ su…

math.CO2018

The Erdös-Sós Conjecture for Spiders

Genghua Fan, Yanmei Hong, Qinghai Liu

The Erdös-Sós conjecture states that if $G$ is a graph with average degree more than $k - 1$ , then G contains every tree of $k$ edges. A spider is a tree with at most one vertex of d…