Jiangdong Ai

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

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

collaborators

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

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

On degree power sum in $P_{k}$ -free graphs

Jiangdong Ai, Fankang He, Yihang Liu +1

Let $G$ be a graph on $n$ vertices with degree sequence $(d_{1}, d_{2} ...... d_{n})$ . For a real $p \geq 1$ , let $D_{p} (G) = \sum_{i = 1}^{n} d_{i}^{p}$ . A Turán-type problem of degree power sum was in…

math.CO2024

Solution on strong partition of $2$ -balanced regular multipartite tournaments

Jiangdong Ai, Fankang He, Yihang Liu

We call a partition of a $c$ -partite tournament into tournaments of order $c$ is strong if each tournament is strongly connected. The strong partition number denoted as $S T (r)$ , re…

math.CO2024

Graph operations and a unified method for kinds of Turán-type problems on paths, cycles and matchings

Jiangdong Ai, Hui Lei, Bo Ning +1

Let $G$ be a connected graph and $P (G)$ a graph parameter. We say that $P (G)$ is feasible if $P (G)$ satisfies the following properties: (I) $\mathcal{…

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…

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

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

A complete characterization of split digraphs with a strong arc decomposition

On degree power sum in Pk​-free graphs

Solution on strong partition of 2-balanced regular multipartite tournaments

Graph operations and a unified method for kinds of Turán-type problems on paths, cycles and matchings

A new perspective from hypertournaments to tournaments

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

On degree power sum in $P_{k}$ -free graphs

Solution on strong partition of $2$ -balanced regular multipartite tournaments