Chang-Xin Wang

most citedA complete characterization of split digraphs with a strong arc decomposition

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2026

Maximal anti-Ramsey problems for posets

Binlong Li, Balázs Patkós, Changxin Wang

We study the forbidden poset analog of the maximal anti-Ramsey problem introduced for graphs by Burr, Erd\H os, Graham, and Sós. For integers $m \leq 2^{n}$ and poset $P = (P, ⪯)$ ,…

math.CO2024★ 1 cited

A complete characterization of split digraphs with a strong arc decomposition

Jiangdong Ai, Fankang He, Zhaoxiang Li +2

A \textbf{strong arc decomposition} of a (multi-)digraph $D (V, A)$ is a partition of its arc set $A$ into two disjoint arc sets $A_{1}$ and $A_{2}$ such that both of the spanning subdi…

math.CO2024

A new perspective from hypertournaments to tournaments

Jiangdong Ai, Qiming Dai, Qiwen Guo +2

A $k$ -tournament $H$ on $n$ vertices is a pair $(V, A)$ for $2 \leq k \leq n$ , where $V (H)$ is a set of vertices, and $A (H)$ is a set of all possible $k$ -tuples of vertices, such tha…