Hongliang Lu

activity

20232026

collaborators

Showing 2025Show all

4 papers · 1 filter

math.CO2025

Anti-Ramsey Number of Stars in 3-uniform hypergraphs

Hongliang Lu, Xinyue Luo, Xinxin Ma

An edge-colored hypergraph is called \emph{a rainbow hypergraph} if all the colors on its edges are distinct. Given two positive integers $n, r$ and an $r$ -uniform hypergraph $\math…

math.CO2025

Rainbow matchings in edge-colored graphs

Hongliang Lu, Zixuan Yang, Feihong Yuan

Let $G$ be an edge-colored graph. We use $e (G)$ and $c (G)$ to denote the number of edges and colors in $G$ , respectively. A subgraph $H$ is called rainbow if $c (H) = e (H)$ . Li et al.…

math.CO2025

Anti-Ramsey number of intersecting cliques

Hongliang Lu, Xinyue Luo, Xinxin Ma

An edge-colored graph is called a rainbow graph if all its edges have distinct colors. The anti-Ramsey number $a r (n, G)$ , for a graph $G$ and a positive integer $n$ , is defined as…

math.CO2025

New Bounds on the Anti-Ramsey Number of Independent Triangles

Hongliang Lu, Xinyue Luo, Xinxin Ma

An edge-colored graph is called \textit{rainbow graph} if all the colors on its edges are distinct. Given a positive integer $n$ and a graph $G$ , the \textit{anti-Ramsey number} $a…