From the 2 of 12 linked papers with an AI index.
12 papers
Improved Bounds for Unavoidable Claws in Tournaments
Jiangdong Ai, Yongxin Lan
Let be the largest integer such that every -vertex claw with at most branches occurs in every tournament on vertices, and let $c_{\mathrm{claw}}=\limsup_{n\to…
The Complexity of Mixed Arc-Disjoint Spanning Subdigraphs with Antistrong Connectivity
Jiangdong Ai, Gregory Gutin, Hui Lei +1
A trail is antidirected if its arcs alternate between forward and backward. A digraph is antistrong if, for every ordered pair of distinct vertices , it contains a…
Finite palette endpoints and degree-square Turán problems
Jiangdong Ai, Bin Chen, Ming Chen +2
The paper investigates extremal color‑palette problems motivated by uniform Turán densities of 3‑uniform hypergraphs, showing they reduce to maximizing the sum of squared out‑degre…
On Seymour's and Sullivan's Second Neighbourhood Conjectures
Jiangdong Ai, Stefanie Gerke, Gregory Gutin +3
The paper investigates Seymour's and Sullivan's second neighbourhood conjectures for directed graphs, giving a condition based on the number of transitive triangles that ensures Su…
Quasi-kernels in Hereditary Classes and Applications to Break
Jiangdong Ai, Tianyu Huang, Xiangzhou Liu +2
Recently, Nguyen, Seymour and Scott verified the small quasi-kernel conjecture for split digraphs, and initiated the study of quasi-kernels in break digraphs. Following their resea…
Large induced subgraphs with prescribed degree parity
Jiangdong Ai, Qiwen Guo, Gregory Gutin +2
A long-standing conjecture of Caro (Discrete Math, 1994), confirmed by Ferber and Krivelevich (Adv Math, 2022), states that every -vertex graph without isolated vertices con…