Zixuan Yang

activity

20202026

collaborators

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

math.CO2020

A characterization for graphs having strong parity factors

Hongliang Lu, Zixuan Yang, Xuechun Zhang

A graph $G$ has the \emph{strong parity property} if for every subset $X \subseteq V$ with $∣ X ∣$ even, $G$ has a spanning subgraph $F$ with minimum degree at least one such that $d_…

math.CO2020

Regular graphs with equal matching number and independence number

Hongliang Lu, Xixuan yang

Let $r \geq 3$ be an integer and $G$ be a graph. Let $δ (G), Δ (G)$ , $α (G)$ and $μ (G)$ denotes minimum degree, maximum degree, independence number and matching number of $G$ , respecti…

On the maximal anti-Ramsey problem of Burr, Erdős, Graham, and Sós for P4​

Rainbow matchings in edge-colored graphs

A characterization for graphs having strong parity factors

Regular graphs with equal matching number and independence number

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