Ting Huang

collaborators

7 papers

math.CO2026

New upper bound for the Ramsey number of odd cycles

Ting Huang, Jiabao Yang, Yaojun Chen

The \emph{ $k$ -color Ramsey number} $R_{k} (C_{2 ℓ + 1})$ is the least integer $n$ such that any $k$ -edge-coloring of a complete graph $K_{n}$ has a monochromatic odd cycle $C_{2 ℓ + 1}$ …

math.CO2026

A note on tree-cycle Ramsey numbers

Ting Huang, Yanbo Zhang, Yaojun Chen

Let $R (T_{n}, C_{m})$ denote the Ramsey number of a tree $T_{n}$ on $n$ vertices versus a cycle $C_{m}$ of length $m$ . Burr, ErdÅs, Faudree, Rousseau, and Schelp (1982) asked for the least…

math.CO2026

Odd covers for complete graphs and complete 3-graphs

Ting Huang, Jiabao Yang, Yaojun Chen

The Graham-Pollak theorem says that one needs at least $n - 1$ complete bipartite graphs to cover each edge of a complete graph $K_{n}$ on $n$ vertices exactly once. The odd cover…

math.CO2026

On the threshold Ramsey multiplicity conjectures for paths and even cycles

Ting Huang, Jiabao Yang, Yaojun Chen

The Ramsey number $r (H)$ of a graph $H$ is the minimum positive integer $n$ such that every red/blue edge-coloring of the complete graph $K_{n}$ on $n$ vertices contains a monochroma…

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 + I^µ)$ edges, where $I^µ$ is a con…