📝 SummarXiv

Abstract

In 1963, Dirac proved that every $n$-vertex graph has $k$ vertex-disjoint triangles if $n\geq 3k$ and minimum degree $\delta(G)\geq \frac{n+k}{2}$. The base case $n=3k$ can be reduced to the Corr\'adi-Hajn\'al Theorem. Towards a rainbow version of Dirac's Theorem, Hu, Li, and Yang conjectured that for all positive integers $n$ and $k$ with $n\geq 3k$, every edge-colored graph $G$ of order $n$ with $\delta^c(G)\geq \frac{n+k}{2}$ contains $k$ vertex-disjoint rainbow triangles. In another direction, Wu et al. conjectured an exact formula for anti-Ramsey number $ar(n,kC_3)$, generalizing the earlier work of Erd\H{o}s, S\'os and Simonovits. The conjecture of Hu, Li, and Yang was confirmed for the cases $k=1$ and $k=2$. However, Lo and Williams disproved the conjecture when $n\leq \frac{17k}{5}.$ It is therefore natural to ask whether the conjecture holds for $n=\Omega(k)$. In this paper, we confirm this by showing that the Hu-Li-Yang conjecture holds when $n\ge 42.5k+48$. We disprove the conjecture of Wu et al. and propose a modified conjecture. This conjecture is motivated by previous works due to Allen, B\"{o}ttcher, Hladk\'{y}, and Piguet on Tur\'an number of vertex-disjoint triangles.