Jiangdong Ai

collaborators

2 papers

math.CO2026

A Linear Lower Bound for Dominating Sets in $k$ -Majority Tournaments

Jiangdong Ai, Xiangjie Yi

A $k$ -majority tournament on a finite vertex set is defined by $2 k - 1$ linear orders, with $u \to v$ when $u$ lies above $v$ in at least $k$ of the orders. Let $F (k)$ be the maximum,…

math.CO2024

Arc-disjoint in- and out-branchings in semicomplete split digraphs

Jiangdong Ai, Yiming Hao, Zhaoxiang Li +1

An \emph{out-tree (in-tree)} is an oriented tree where every vertex except one, called the \emph{root}, has in-degree (out-degree) one. An \emph{out-branching $B_{u}^{+}$ (in-branching…

A Linear Lower Bound for Dominating Sets in k-Majority Tournaments

Arc-disjoint in- and out-branchings in semicomplete split digraphs

A Linear Lower Bound for Dominating Sets in $k$ -Majority Tournaments