Ruonan Li

activity

20172026

most citedVertex-disjoint properly edge-colored cycles in edge-colored complete graphs

3 citations · 4 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2026

Berge tight cycles of all lengths in hypergraphs

Yu Minghui, Li Binlong, Li Ruonan

Given a set $R$ of positive integers, an $R$ -graph $H = (V, E)$ is a hypergraph where the cardinality of each hyperedge belongs to $R$ . If $R = {r}$ , we sometimes refer to the hy…

math.CO2024

The absence of monochromatic triangle implies various properly colored spanning trees

Ruonan Li, Ruhui Lu, Xueli Su +1

An edge-colored graph $G$ is called properly colored if every two adjacent edges are assigned different colors. A monochromatic triangle is a cycle of length 3 with all the edges h…

math.CO2020★ 1 cited

Properly colored cycles in edge-colored complete graphs containing no monochromatic triangles: a vertex-pancyclic analogous result

Ruonan Li

A properly colored cycle (path) in an edge-colored graph is a cycle (path) with consecutive edges assigned distinct colors. A monochromatic triangle is a cycle of length $3$ with t…

math.CO2018

Rainbow triangles in arc-colored digraphs

Wei Li, Shenggui Zhang, Ruonan Li

Let $D$ be an arc-colored digraph. The arc number $a (D)$ of $D$ is defined as the number of arcs of $D$ . The color number $c (D)$ of $D$ is defined as the number of colors assigned…

math.CO2018

Rainbow triangles in arc-colored tournaments

Wei Li, Shenggui Zhang, Yandong Bai +1

Let $T_{n}$ be an arc-colored tournament of order $n$ . The maximum monochromatic indegree $Δ^{- m o n} (T_{n})$ (resp. outdegree $Δ^{+ m o n} (T_{n})$ ) of $T_{n}$ is the maximum number of…

math.CO2017★ 3 cited

Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs

Ruonan Li, Hajo Broersma, Shenggui Zhang

It is conjectured that every edge-colored complete graph $G$ on $n$ vertices satisfying $Δ^{m o n} (G) \leq n - 3 k + 1$ contains $k$ vertex-disjoint properly edge-colored cycles. We confir…