Ting Huang

collaborators

3 papers

math.CO2025

Fan-goodness of sparse graphs

Ting Huang, Yanbo Zhang, Yaojun Chen

Let $G$ be a connected graph of order $n$ , $F_{k}$ be a fan consisting of $k$ triangles sharing a common vertex, and $t F_{k}$ be $t$ vertex-disjoint copies of $F_{k}$ . Brennan (2017) sho…

math.CO2025

Ramsey numbers of sparse graphs versus disjoint books

Ting Huang, Yanbo Zhang, Yaojun Chen

Let $B_{k}$ denote a book on $k + 2$ vertices and $t B_{k}$ be $t$ vertex-disjoint $B_{k}$ 's. Let $G$ be a connected graph with $n$ vertices and at most $n (1 + ε)$ edges, where $ε$ is a const…

math.CO2025

Minimum degree and sparse connected spanning subgraphs

Ting Huang, Yanbo Zhang, Yaojun Chen

Let $G$ be a connected graph on $n$ vertices and at most $n (1 + ε)$ edges with bounded maximum degree, and $F$ a graph on $n$ vertices with minimum degree at least $n - k$ , where $ε$ i…