Xinxin Ma

activity

20222025

collaborators

7 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…

math.CO2024

A characterization on $(g, f)$ -parity orientations

Hongliang Lu, Xinxin Ma

Let $G$ be a graph and $g, f : V (G) \to 2^{N}$ be two set functions such that $g (v) \leq f (v)$ and $g (v) \equiv f (v) (mod 2)$ for every $v \in V (G)$ . An orientation $O$ of $G$ is called a $(g,…

math.CO2023

A characterization on orientations of graphs avoiding given lists on out-degrees

Xinxin Ma, Hongliang Lu

Let $G$ be a graph and $F : V (G) \to 2^{N}$ be a set function. The graph $G$ is said to be \emph{F-avoiding} if there exists an orientation $O$ of $G$ such that $d_{O}^{+} (v) \in / F (v)$ for…

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…

Anti-Ramsey Number of Stars in 3-uniform hypergraphs

Anti-Ramsey number of intersecting cliques

New Bounds on the Anti-Ramsey Number of Independent Triangles

Matching stability for 3-partite 3-uniform hypergraphs

A characterization on (g,f)-parity orientations

A characterization on orientations of graphs avoiding given lists on out-degrees

Spectral radius and rainbow matchings of graphs

A characterization on $(g, f)$ -parity orientations