Xiaofan Yuan

collaborators

2 papers

math.CO2024

Tight minimum colored degree condition for rainbow connectivity

Andrzej Czygrinow, Xiaofan Yuan

Let $G = (V, E)$ be a graph on $n$ vertices, and let $c : E \to P$ , where $P$ is a set of colors. Let $δ^{c} (G) = min_{v \in V} {d^{c} (v)}$ where $d^{c} (v)$ is the number of colors…

math.CO2023

A tight bound on ${C_{3}, C_{5}}$ -free connected graphs with positive Lin-Lu-Yau Ricci curvature

E. G. K. M. Gamlath, Xiaonan Liu, Linyuan Lu +1

In this paper, we prove that any simple ${C_{3}, C_{5}}$ -free non-empty connected graph $G$ with LLY curvature bounded below by $κ > 0$ has the order at most $2^{\frac{2}{κ}}$ . This upper…

Tight minimum colored degree condition for rainbow connectivity

A tight bound on {C3​,C5​}-free connected graphs with positive Lin-Lu-Yau Ricci curvature

A tight bound on ${C_{3}, C_{5}}$ -free connected graphs with positive Lin-Lu-Yau Ricci curvature