Zixuan Yang

collaborators

2 papers

math.CO2026

On the maximal anti-Ramsey problem of Burr, ErdÅs, Graham, and SÃ³s for $P_{4}$

Zixuan Yang

Given a graph $L$ , the maximal anti-Ramsey function $\chiS(n,e,L)$ denotes the minimum integer $\chiS$ for which there exists an $n$ -vertex graph $G$ with at least $e$ edges admitt…

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

On the maximal anti-Ramsey problem of Burr, ErdÅs, Graham, and SÃ³s for P4​

Rainbow matchings in edge-colored graphs

On the maximal anti-Ramsey problem of Burr, ErdÅs, Graham, and SÃ³s for $P_{4}$