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.CO2024

Matching stability for 3-partite 3-uniform hypergraphs

Hongliang Lu, Xinxin Ma

Let $n, k, s$ be three integers such that $k \geq 2$ and $n \geq s \geq 1$ . Let $H$ be a $k$ -partite $k$ -uniform hypergraph with $n$ vertices in each class. Aharoni (2017) showed that i…