Yuting Tian

collaborators

2 papers

math.CO2026

Rainbow triangles in edge-colored graphs with large minimum color degree

Bo Ning, Yuting Tian

Let $G$ be an edge-colored graph on $n$ vertices, and let $\deltac(G)$ denote its minimum color degree. Li and, independently Li, Ning, Xu, and Zhang, proved that every edge-colore…

math.CO2025

Two conjectures on vertex-disjoint rainbow triangles

Xu Liu, Bo Ning, Yuting Tian

In 1963, Dirac proved that every $n$ -vertex graph has $k$ vertex-disjoint triangles if $n \geq 3 k$ and minimum degree $I^´ (G) \geq \frac{n + k}{2}$ . The base case $n = 3 k$ can be reduced…