Xinxin Ma

collaborators

4 papers

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

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…

math.CO2022

Spectral radius and rainbow matchings of graphs

Mingyang Guo, Hongliang Lu, Xinxin Ma +1

Let $n, m$ be integers such that $1 \leq m \leq (n - 2) /2$ and let $[n] = {1, \dots, n}$ . Let $G = {G_{1}, \dots, G_{m + 1}}$ be a family of graphs on the same vertex set $[n]$ . In…