Chenxu Yang

collaborators

3 papers

math.CO2026

On the minimum number of monochromatic solutions to the strict Schur inequality in 2-colored integer intervals with negative left endpoint

Gang Yang, Jinxia Liang, Yaping Mao +2

Kosek, Robertson, Sabo, and Schaal studied the minimum number $M_k(n)$ of monochromatic solutions to the strict Schur inequality system $x_{1} \leq x_{2} \leq x_{3}$ and $x_{1} + x_{2} < x_{3}$ in \…

math.CO2025

Constructing disjoint Steiner trees in SierpiÅski graphs

Chenxu Yang, Ping Li, Yaping Mao +2

Let $G$ be a graph and $S \subseteq V (G)$ with $∣ S ∣ \geq 2$ . Then the trees $T_{1}, T_{2}, \dots, T_{ℓ}$ in $G$ are \emph{internally disjoint Steiner trees} connecting $S$ (or $S$ -Stei…

math.CO2025

Gallai-Schur Triples and Related Problems

Yaping Mao, Aaron Robertson, Jian Wang +2

Schur's Theorem states that, for any $r \in Z^{+}$ , there exists a minimum integer $S (r)$ such that every $r$ -coloring of ${1, 2, \dots, S (r)}$ admits a monochromatic solutio…

On the minimum number of monochromatic solutions to the strict Schur inequality in 2-colored integer intervals with negative left endpoint

Constructing disjoint Steiner trees in SierpiÅski graphs

Gallai-Schur Triples and Related Problems

Constructing disjoint Steiner trees in SierpiÅski graphs